Paradigms of Combinatorial Optimization

Vangelis Paschos is Professor of Computer Science at the University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals.

• Preface xvii Vangelis 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 Daniele VigoChapter 6 The Maximum Cut Problem 131Walid Ben-Ameur, Ali Ridha Mahjoub and José NetoChapter 7 The Traveling Salesman Problem and its Variations 173Jé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 Optimization Problems 381Luca TrevisanChapter 14 Local Search: Complexity and Approximation 435Eric Angel, Petros Christopoulos and Vassilis ZissimopoulosChapter 15 On-line Algorithms 473Giorgio Ausiello and Luca BecchettiChapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511Eric Angel, Evripidis Bampis and Laurent GourvesChapter 17 An Introduction to Inverse Combinatorial Problems 547Marc 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 Agents 675Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual and Olivier SpanjaardGeneral Bibliography 707List of Authors 767Index 773Summary of Other Volumes in the Series 781