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 aims 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. Paradigms of Combinatorial Optimization is divided in two parts: Paradigmatic Problems, that handles several famous combinatorial optimization problems as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of the Combinatorial Optimization as one of the most active actual scientific domains; Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.

Combinatorial optimization is a multidisciplinary scientific arealying in the interface of three major scientific domains:mathematics, theoretical computer science and management.The three volumes of the Combinatorial Optimization series aims tocover a wide range of topics in this area. These topics also dealwith fundamental notions and approaches as with several classicalapplications of combinatorial optimization."Paradigms of Combinatorial Optimization" is divided intwo parts:* Paradigmatic Problems, that handles several famouscombinatorial optimization problems as max cut, min coloringoptimal satisfiability tsp, etc., the study of which has largelycontributed to both the development, the legitimization and theestablishment of the Combinatorial Optimization as one of the mostactive actual scientific domains;* Classical and New Approaches, that presents the severalmethodological approaches that fertilize and are fertilized byCombinatorial optimization such as: Polynomial ApproximationOnline Computation, Robustness, etc., and, more recentlyAlgorithmic Game Theory.

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 Daniele VIGOChapter 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 215Gérard 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 Vassilis ZISSIMOPOULOSChapter 15. On-line Algorithms 473Giorgio AUSIELLO and Luca BECCHETTIChapter 16. Polynomial Approximation for MulticriteriaCombinatorial Optimization Problems 511Eric ANGEL, Evripidis BAMPIS and Laurent GOURVÈSChapter 17. An Introduction to Inverse Combinatorial Problems547Marc DEMANGE and Jérôme MONNOTChapter 18. Probabilistic Combinatorial Optimization 587Cécile MURAT and Vangelis Th. PASCHOSChapter 19. Robust Shortest Path Problems 615Virginie GABREL and Cécile MURATChapter 20. Algorithmic Games 641Aristotelis GIANNAKOS and Vangelis PASCHOSList of Authors 675Index 681Summary of Other Volumes in the Series 689