Freshly Printed - allow 7 days lead
Couldn't load pickup availability
Paradigms of Combinatorial Optimization
Problems and New Approaches
Vangelis Th. Paschos (Edited by), VT Paschos (Author)
9781848216570, Wiley
Hardback, published 29 July 2014
816 pages
24.1 x 16.5 x 5.1 cm, 1.343 kg
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 aim 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.
Concepts of Combinatorial Optimization, is divided into three parts:
- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.
Preface xvii Vangelis Th. Paschos Part I Paradigmatic Problems 1 Chapter 1 Optimal Satisfiability 3 Chapter 2 Scheduling Problems 33 Chapter 3 Location Problems 61 Chapter 4 MiniMax Algorithms and Games 89 Chapter 5 Two-dimensional Bin Packing Problems 107 Chapter 6 The Maximum Cut Problem 131 Chapter 7 The Traveling Salesman Problem and its Variations 173 Chapter 8 0-1 Knapsack Problems 215 Chapter 9 Integer Quadratic Knapsack Problems 243 Chapter 10 Graph Coloring Problems 265 Part II New Approaches 311 Chapter 11 Polynomial Approximation 313 Chapter 12 Approximation Preserving Reductions 351 Chapter 13 Inapproximability of Combinatorial Optimization Problems 381 Chapter 14 Local Search: Complexity and Approximation 435 Chapter 15 On-line Algorithms 473 Chapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511 Chapter 17 An Introduction to Inverse Combinatorial Problems 547 Chapter 18 Probabilistic Combinatorial Optimization 587 Chapter 19 Robust Shortest Path Problems 615 Chapter 20 Algorithmic Games 641 Chapter 21 Combinatorial Optimization with Competing Agents 675 General Bibliography 707 List of Authors 767 Index 773 Summary of Other Volumes in the Series 781
Cristina Bazgan
Philippe Chrétienne and Christophe Picouleau
Aristotelis Giannakos
Michel Koskas
Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo
Walid Ben-Ameur, Ali Ridha Mahjoub and José Neto
Jérôme Monnot and Sophie Toulouse
Gerard Plateau and Anass Nagih
Dominique Quadri, Eric Soutif and Pierre Tolla
Dominique De Werra and Daniel Kobler
Marc Demange and Vangelis Th. Paschos
Giorgio Ausiello and Vangelis Th. Paschos
Luca Trevisan
Eric Angel, Petros Christopoulos and Vassilis Zissimopoulos
Giorgio Ausiello and Luca Becchetti
Eric Angel, Evripidis Bampis and Laurent Gourves
Marc Demange and Jérôme Monnot
Cecile Murat and Vangelis Th. Paschos
Virginie Gabrel and Cécile Murat
Aristotelis Giannakos and Bangelis Paschos
Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual and Olivier Spanjaard
Subject Areas: Mathematics [PB]
