Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. The three volumes of the Combinatorial Optimization series aim to cover a wide range of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

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 problemspresenting 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.

Preface xviiVangelis Th. PaschosPart I Paradigmatic Problems 1Chapter 1 Optimal Satisfiability 3Cristina BazganChapter 2 Scheduling Problems 33Philippe Chrétienne and Christophe PicouleauChapter 3 Location Problems 61Aristotelis GiannakosChapter 4 MiniMax Algorithms and Games 89Michel KoskasChapter 5 Two-dimensional Bin Packing Problems 107Andrea Lodi, Silvano Martello, Michele Monaci and DanieleVigoChapter 6 The Maximum Cut Problem 131Walid Ben-Ameur, Ali Ridha Mahjoub and José NetoChapter 7 The Traveling Salesman Problem and its Variations173Jérôme Monnot and Sophie ToulouseChapter 8 0-1 Knapsack Problems 215Gerard Plateau and Anass NagihChapter 9 Integer Quadratic Knapsack Problems 243Dominique Quadri, Eric Soutif and Pierre TollaChapter 10 Graph Coloring Problems 265Dominique De Werra and Daniel KoblerPart II New Approaches 311Chapter 11 Polynomial Approximation 313Marc Demange and Vangelis Th. PaschosChapter 12 Approximation Preserving Reductions 351Giorgio Ausiello and Vangelis Th. PaschosChapter 13 Inapproximability of Combinatorial OptimizationProblems 381Luca TrevisanChapter 14 Local Search: Complexity and Approximation 435Eric Angel, Petros Christopoulos and VassilisZissimopoulosChapter 15 On-line Algorithms 473Giorgio Ausiello and Luca BecchettiChapter 16 Polynomial Approximation for MulticriteriaCombinatorial Optimization Problems 511Eric Angel, Evripidis Bampis and Laurent GourvesChapter 17 An Introduction to Inverse Combinatorial Problems547Marc Demange and Jérôme MonnotChapter 18 Probabilistic Combinatorial Optimization 587Cecile Murat and Vangelis Th. PaschosChapter 19 Robust Shortest Path Problems 615Virginie Gabrel and Cécile MuratChapter 20 Algorithmic Games 641Aristotelis Giannakos and Bangelis PaschosChapter 21 Combinatorial Optimization with Competing Agents675Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, FannyPascual and Olivier SpanjaardGeneral Bibliography 707List of Authors 767Index 773Summary of Other Volumes in the Series 781