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 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 coloring,optimal 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 Approximation,Online Computation, Robustness, etc., and, more recently,Algorithmic Game Theory.
Vangelis Th. Paschos is Exceptional Professor of Computer Science and Combinatorial Optimization at the University Paris-Dauphine and chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include the complexity theory, the theory of the polynomial approximation of NP-hard problems, the probabilistic combinatorial optimization, the on-line computation and the exact solution of NP-hard problems. He is the author of more than a hundred and fifty research papers. He is also member of the editorial board of several international scientific journals.
Preface xvii Vangelis Th. PASCHOS PART I. PARADIGMATIC PROBLEMS 1 Chapter 1. Optimal Satisfiability 3 Cristina BAZGAN Chapter 2. Scheduling Problems 33 Philippe CHRETIENNE 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 Daniele VIGO Chapter 6. The Maximum Cut Problem 131 Walid BEN-AMEUR, Ali Ridha MAHJOUB and Jose NETO Chapter 7. The Traveling Salesman Problem and its Variations173 Jerome 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 Vassilis ZISSIMOPOULOS 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 Jerome MONNOT Chapter 18. Probabilistic Combinatorial Optimization 587 Cecile MURAT and Vangelis Th. PASCHOS Chapter 19. Robust Shortest Path Problems 615 Virginie GABREL and Cecile MURAT Chapter 20. Algorithmic Games 641 Aristotelis GIANNAKOS and Vangelis PASCHOS List of Authors 675 Index 681 Summary of Other Volumes in the Series 689