Paradigms of Combinatorial Optimization
Problems and New Approaches
2nd Edition
Published on 8. August 2014
720 pages
978-1-119-01516-1 (ISBN)
Description
Combinatorial optimization is a multidisciplinary scientificarea, lying in the interface of three major scientific domains:mathematics, theoretical computer science and management. Thethree volumes of the Combinatorial Optimization series aim to covera wide range of topics in this area. These topics also dealwith fundamental notions and approaches as with several classicalapplications of combinatorial optimization.
Concepts of Combinatorial Optimization, is divided intothree parts:
- On the complexity of combinatorial optimization problems,presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methodsfor solving hard combinatorial optimization problems, that areBranch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentalsfrom mathematical programming based methods that are in the heartof Operations Research since the origins of this field.
More details
Other editions
Additional editions
Book
07/2014
2nd Edition
Wiley-ISTE
€314.50
Article not available at the moment
Previous edition
E-Book
02/2013
Wiley-ISTE
€314.99
Available for download
Content
Preface xvii
Vangelis Th. Paschos
Part I Paradigmatic Problems 1
Chapter 1 Optimal Satisfiability 3
Cristina Bazgan
Chapter 2 Scheduling Problems 33
Philippe Chrétienne and Christophe Picouleau
Chapter 3 Location Problems 61
Aristotelis Giannakos
Chapter 4 MiniMax Algorithms and Games 89
Michel Koskas
Chapter 5 Two-dimensional Bin Packing Problems 107
Andrea Lodi, Silvano Martello, Michele Monaci and DanieleVigo
Chapter 6 The Maximum Cut Problem 131
Walid Ben-Ameur, Ali Ridha Mahjoub and José Neto
Chapter 7 The Traveling Salesman Problem and its Variations173
Jérôme Monnot and Sophie Toulouse
Chapter 8 0-1 Knapsack Problems 215
Gerard Plateau and Anass Nagih
Chapter 9 Integer Quadratic Knapsack Problems 243
Dominique Quadri, Eric Soutif and Pierre Tolla
Chapter 10 Graph Coloring Problems 265
Dominique De Werra and Daniel Kobler
Part II New Approaches 311
Chapter 11 Polynomial Approximation 313
Marc Demange and Vangelis Th. Paschos
Chapter 12 Approximation Preserving Reductions 351
Giorgio Ausiello and Vangelis Th. Paschos
Chapter 13 Inapproximability of Combinatorial OptimizationProblems 381
Luca Trevisan
Chapter 14 Local Search: Complexity and Approximation 435
Eric Angel, Petros Christopoulos and VassilisZissimopoulos
Chapter 15 On-line Algorithms 473
Giorgio Ausiello and Luca Becchetti
Chapter 16 Polynomial Approximation for MulticriteriaCombinatorial Optimization Problems 511
Eric Angel, Evripidis Bampis and Laurent Gourves
Chapter 17 An Introduction to Inverse Combinatorial Problems547
Marc Demange and Jérôme Monnot
Chapter 18 Probabilistic Combinatorial Optimization 587
Cecile Murat and Vangelis Th. Paschos
Chapter 19 Robust Shortest Path Problems 615
Virginie Gabrel and Cécile Murat
Chapter 20 Algorithmic Games 641
Aristotelis Giannakos and Bangelis Paschos
Chapter 21 Combinatorial Optimization with Competing Agents675
Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, FannyPascual and Olivier Spanjaard
General Bibliography 707
List of Authors 767
Index 773
Summary of Other Volumes in the Series 781
