Paradigms of Combinatorial Optimization. Problems and New Approaches. 2nd Edition

  • ID: 2708445
  • Book
  • 720 Pages
  • John Wiley and Sons Ltd
1 of 4

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.

Note: Product cover images may vary from those shown
2 of 4
Preface xvii

Vangelis Th. Paschos

Part I Paradigmatic Problems 1

Chapter 1 Optimal Satisfiability 3Cristina Bazgan

Chapter 2 Scheduling Problems 33Philippe Chrétienne and Christophe Picouleau

Chapter 3 Location Problems 61Aristotelis Giannakos

Chapter 4 MiniMax Algorithms and Games 89Michel Koskas

Chapter 5 Two–dimensional Bin Packing Problems 107Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo

Chapter 6 The Maximum Cut Problem 131Walid Ben–Ameur, Ali Ridha Mahjoub and José Neto

Chapter 7 The Traveling Salesman Problem and its Variations 173Jérôme Monnot and Sophie Toulouse

Chapter 8 0–1 Knapsack Problems 215Gerard Plateau and Anass Nagih

Chapter 9 Integer Quadratic Knapsack Problems 243Dominique Quadri, Eric Soutif and Pierre Tolla

Chapter 10 Graph Coloring Problems 265Dominique De Werra and Daniel Kobler

Part II New Approaches 311

Chapter 11 Polynomial Approximation 313Marc Demange and Vangelis Th. Paschos

Chapter 12 Approximation Preserving Reductions 351Giorgio Ausiello and Vangelis Th. Paschos

Chapter 13 Inapproximability of Combinatorial Optimization Problems 381Luca Trevisan

Chapter 14 Local Search: Complexity and Approximation 435Eric Angel, Petros Christopoulos and Vassilis Zissimopoulos

Chapter 15 On–line Algorithms 473Giorgio Ausiello and Luca Becchetti

Chapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511Eric Angel, Evripidis Bampis and Laurent Gourves

Chapter 17 An Introduction to Inverse Combinatorial Problems 547Marc Demange and Jérôme Monnot

Chapter 18 Probabilistic Combinatorial Optimization 587Cecile Murat and Vangelis Th. Paschos

Chapter 19 Robust Shortest Path Problems  615Virginie Gabrel and Cécile Murat

Chapter 20 Algorithmic Games 641Aristotelis Giannakos and Bangelis Paschos

Chapter 21 Combinatorial Optimization with Competing Agents 675Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual and Olivier Spanjaard

General Bibliography 707

List of Authors 767

Index 773

Summary of Other Volumes in the Series 781

Note: Product cover images may vary from those shown
3 of 4

Loading
LOADING...

4 of 4
Vangelis Th. Paschos
Note: Product cover images may vary from those shown
5 of 4
Note: Product cover images may vary from those shown
Adroll
adroll