Table of Contents
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 Daniele VIGO
Chapter 6. The Maximum Cut Problem 131 Walid BEN-AMEUR, Ali Ridha MAHJOUB and José NETO
Chapter 7. The Traveling Salesman Problem and its Variations 173 Jérôme MONNOT and Sophie TOULOUSE
Chapter 8. 0–1 Knapsack Problems 215 Gérard 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 Optimization Problems 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 Multicriteria Combinatorial Optimization Problems 511 Eric ANGEL, Evripidis BAMPIS and Laurent GOURVÈS
Chapter 17. An Introduction to Inverse Combinatorial Problems 547 Marc DEMANGE and Jérôme MONNOT
Chapter 18. Probabilistic Combinatorial Optimization 587 Cécile 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 Vangelis PASCHOS
List of Authors 675
Index 681
Summary of Other Volumes in the Series 689
