Approximability of hard combinatorial optimization problems: an introduction

被引：0

作者：

Francesco Maffioli

Giulia Galbiati

机构：

[1] Politecnico di Milano,Dipartimento di Elettronica

[2] Università di Pavia,undefined

来源：

Annals of Operations Research | 2000年 / 96卷

关键词：

Feasible Solution; Polynomial Time; Performance Ratio; Span Tree Problem; Polynomial Time Approximation Scheme;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：221 / 236

页数：15

共 50 条

[1] Approximability of hard combinatorial optimization problems: an introduction
Maffioli, F
Galbiati, G
ANNALS OF OPERATIONS RESEARCH, 2000, 96 (1-4) : 221 - 236
[2] On the approximability of combinatorial exchange problems
Babaioff, Moshe
Briest, Patrick
Krysta, Piotr
ALGORITHMIC GAME THEORY, PROCEEDINGS, 2008, 4997 : 83 - +
[3] A BRIEF INTRODUCTION TO EXACT, APPROXIMATION, AND HEURISTIC ALGORITHMS FOR SOLVING HARD COMBINATORIAL OPTIMIZATION PROBLEMS
Festa, P.
2014 16TH INTERNATIONAL CONFERENCE ON TRANSPARENT OPTICAL NETWORKS (ICTON), 2014,
[4] COMBINATORIAL OPTIMIZATION PROBLEMS WITH SOFT AND HARD REQUIREMENTS
EISELT, HA
LAPORTE, G
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1987, 38 (09) : 785 - 795
[5] The bundle method for hard combinatorial optimization problems
Gruber, G
Rendl, F
COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 78 - 88
[6] The Approximability Behaviour of Some Combinatorial Problems with Respect to the Approximability of a Class of Maximum Independent Set Problems
Marc Demange
Vangelis Th. Paschos
Computational Optimization and Applications, 1997, 7 : 307 - 324
[7] THE APPROXIMABILITY BEHAVIOR OF SOME COMBINATORIAL PROBLEMS WITH RESPECT TO THE APPROXIMABILITY OF A CLASS OF MAXIMUM INDEPENDENT SET PROBLEMS
DEMANGE, M
PASCHOS, VT
COMPTES RENDUS DE L ACADEMIE DES SCIENCES SERIE I-MATHEMATIQUE, 1995, 321 (05): : 645 - 648
[8] The approximability behaviour of some combinatorial problems with respect to the approximability of a class of maximum independent set problems
Demange, M
Paschos, VT
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 1997, 7 (03) : 307 - 324
[9] BUYING CHEAP IS EXPENSIVE: APPROXIMABILITY OF COMBINATORIAL PRICING PROBLEMS
Briest, Patrick
Krysta, Piotr
SIAM JOURNAL ON COMPUTING, 2011, 40 (06) : 1554 - 1586
[10] Efficiently solvable special cases of hard combinatorial optimization problems
Rainer E. Burkard
Mathematical Programming, 1997, 79 : 55 - 69

← 1 2 3 4 5 →