Paradigms of Combinatorial Optimization V 2
Problems and New Approaches, Volume 2
Samenvatting
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.
Specificaties
Inhoudsopgave
<p>PART I. PARADIGMATIC PROBLEMS 1</p>
<p>Chapter 1. Optimal Satisfiability 3<br /> Cristina BAZGAN</p>
<p>Chapter 2. Scheduling Problems 33<br /> Philippe CHRÉTIENNE and Christophe PICOULEAU</p>
<p>Chapter 3. Location Problems 61<br /> Aristotelis GIANNAKOS</p>
<p>Chapter 4. MiniMax Algorithms and Games 89<br /> Michel KOSKAS</p>
<p>Chapter 5. Two–dimensional Bin Packing Problems 107<br /> Andrea LODI, Silvano MARTELLO, Michele MONACI and Daniele VIGO</p>
<p>Chapter 6. The Maximum Cut Problem 131<br /> Walid BEN–AMEUR, Ali Ridha MAHJOUB and José NETO</p>
<p>Chapter 7. The Traveling Salesman Problem and its Variations 173<br /> Jérôme MONNOT and Sophie TOULOUSE</p>
<p>Chapter 8. 0 1 Knapsack Problems 215<br /> Gérard PLATEAU and Anass NAGIH</p>
<p>Chapter 9. Integer Quadratic Knapsack Problems 243<br /> Dominique QUADRI, Eric SOUTIF and Pierre TOLLA</p>
<p>Chapter 10. Graph Coloring Problems 265<br /> Dominique DE WERRA and Daniel KOBLER</p>
<p>PART II. NEW APPROACHES 311</p>
<p>Chapter 11. Polynomial Approximation 313<br /> Marc DEMANGE and Vangelis Th. PASCHOS</p>
<p>Chapter 12. Approximation Preserving Reductions 351<br /> Giorgio AUSIELLO and Vangelis Th. PASCHOS</p>
<p>Chapter 13. Inapproximability of Combinatorial Optimization Problems 381<br /> Luca TREVISAN</p>
<p>Chapter 14. Local Search: Complexity and Approximation 435<br /> Eric ANGEL, Petros CHRISTOPOULOS and Vassilis ZISSIMOPOULOS</p>
<p>Chapter 15. On–line Algorithms 473<br /> Giorgio AUSIELLO and Luca BECCHETTI</p>
<p>Chapter 16. Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511<br /> Eric ANGEL, Evripidis BAMPIS and Laurent GOURVÈS</p>
<p>Chapter 17. An Introduction to Inverse Combinatorial Problems 547<br /> Marc DEMANGE and Jérôme MONNOT</p>
<p>Chapter 18. Probabilistic Combinatorial Optimization 587<br /> Cécile MURAT and Vangelis Th. PASCHOS</p>
<p>Chapter 19. Robust Shortest Path Problems 615<br /> Virginie GABREL and Cécile MURAT</p>
<p>Chapter 20. Algorithmic Games 641<br /> Aristotelis GIANNAKOS and Vangelis PASCHOS</p>
<p>List of Authors 675</p>
<p>Index 681</p>
<p>Summary of Other Volumes in the Series 689</p>