Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Description

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. Content: Chapter 1 Optimal Satisfiability (pages 1–31): Cristina Bazgan Chapter 2 Scheduling Problems (pages 33–59): Philippe Chretienne and Christophe Picouleau Chapter 3 Location Problems (pages 61–87): Aristotelis Giannakos Chapter 4 MiniMax Algorithms and Games (pages 89–106): Michel Koskas Chapter 5 Two?Dimensional Bin Packing Problems (pages 107–129): Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo Chapter 6 The Maximum Cut Problem (pages 131–172): Walid Ben?Ameur, Ali Ridha Mahjoub and Jose Neto Chapter 7 The Traveling Salesman Problem and its Variations (pages 173–214): Jerome Monnot and Sophie Toulouse Chapter 8 0–1 Knapsack Problems (pages 215–242): Gerard Plateau and Anass Nagih Chapter 9 Integer Quadratic Knapsack Problems (pages 243–263): Dominique Quadri, Eric Soutif and Pierre Tolla Chapter 10 Graph Coloring Problems (pages 265–310): Dominique De Werra and Daniel Kobler Chapter 11 Polynomial Approximation (pages 311–349): Marc Demange and Vangelis Th. Paschos Chapter 12 Approximation Preserving Reductions (pages 351–380): Giorgio Ausiello and Vangelis Th. Paschos Chapter 13 Inapproximability of Combinatorial Optimization Problems (pages 381–434): Luca Trevisan Chapter 14 Local Search: Complexity and Approximation (pages 435–471): Eric Angel, Petros Christopoulos and Vassilis Zissimopoulos Chapter 15 On?Line Algorithms (pages 473–509): Giorgio Ausiello and Luca Becchetti Chapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems (pages 511–545): Eric Angel, Evripidis Bampis and Laurent Gourves Chapter 17 An Introduction to Inverse Combinatorial Problems (pages 547–586): Marc Demange and Jerome Monnot Chapter 18 Probabilistic Combinatorial Optimization (pages 587–613): Cecile Murat and Vangelis Th. Paschos Chapter 19 Robust Shortest Path Problems (pages 615–639): Virginie Gabrel and Cecile Murat Chapter 20 Algorithmic Games (pages 641–673): Aristotelis Giannakos and Vangelis Th. Paschos