Details
Paradigms of Combinatorial Optimization
Problems and New Approaches2. Aufl.
|
267,99 € |
|
| Verlag: | Wiley |
| Format: | |
| Veröffentl.: | 08.08.2014 |
| ISBN/EAN: | 9781119015161 |
| Sprache: | englisch |
| Anzahl Seiten: | 720 |
DRM-geschütztes eBook, Sie benötigen z.B. Adobe Digital Editions und eine Adobe ID zum Lesen.
Beschreibungen
<p>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.<br /> <br /> <i>Concepts of Combinatorial Optimization</i>, is divided into three parts:<br /> - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;<br /> - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;<br /> - 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.</p>
Preface xvii <p>Vangelis Th. Paschos</p> <p><b>Part I Paradigmatic Problems 1</b></p> <p>Chapter 1 Optimal Satisfiability 3<br /> <i>Cristina Bazgan</i></p> <p>Chapter 2 Scheduling Problems 33<br /> <i>Philippe Chrétienne and Christophe Picouleau</i></p> <p>Chapter 3 Location Problems 61<br /> <i>Aristotelis Giannakos</i></p> <p>Chapter 4 MiniMax Algorithms and Games 89<br /> <i>Michel Koskas</i></p> <p>Chapter 5 Two-dimensional Bin Packing Problems 107<br /> <i>Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo</i></p> <p>Chapter 6 The Maximum Cut Problem 131<br /> <i>Walid Ben-Ameur, Ali Ridha Mahjoub and José Neto</i></p> <p>Chapter 7 The Traveling Salesman Problem and its Variations 173<br /> <i>Jérôme Monnot and Sophie Toulouse</i></p> <p>Chapter 8 0-1 Knapsack Problems 215<br /> <i>Gerard Plateau and Anass Nagih</i></p> <p>Chapter 9 Integer Quadratic Knapsack Problems 243<br /> <i>Dominique Quadri, Eric Soutif and Pierre Tolla</i></p> <p>Chapter 10 Graph Coloring Problems 265<br /> <i>Dominique De Werra and Daniel Kobler</i></p> <p><b>Part II New Approaches 311</b></p> <p>Chapter 11 Polynomial Approximation 313<br /> <i>Marc Demange and Vangelis Th. Paschos</i></p> <p>Chapter 12 Approximation Preserving Reductions 351<br /> <i>Giorgio Ausiello and Vangelis Th. Paschos</i></p> <p>Chapter 13 Inapproximability of Combinatorial Optimization Problems 381<br /> <i>Luca Trevisan</i></p> <p>Chapter 14 Local Search: Complexity and Approximation 435<br /> <i>Eric Angel, Petros Christopoulos and Vassilis Zissimopoulos</i></p> <p>Chapter 15 On-line Algorithms 473<br /> <i>Giorgio Ausiello and Luca Becchetti</i></p> <p>Chapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511<br /> <i>Eric Angel, Evripidis Bampis and Laurent Gourves</i></p> <p>Chapter 17 An Introduction to Inverse Combinatorial Problems 547<br /> <i>Marc Demange and Jérôme Monnot</i></p> <p>Chapter 18 Probabilistic Combinatorial Optimization 587<br /> <i>Cecile Murat and Vangelis Th. Paschos</i></p> <p>Chapter 19 Robust Shortest Path Problems 615<br /> <i>Virginie Gabrel and Cécile Murat</i></p> <p>Chapter 20 Algorithmic Games 641<br /> <i>Aristotelis Giannakos and Bangelis Paschos</i></p> <p>Chapter 21 Combinatorial Optimization with Competing Agents 675<br /> <i>Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual and Olivier Spanjaard</i></p> <p>General Bibliography 707</p> <p>List of Authors 767</p> <p>Index 773</p> <p>Summary of Other Volumes in the Series 781</p>
<strong>Vangelis Paschos</strong> is Professor of Computer Science at the University of Paris-Dauphine and Chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include complexity theory, the theory of the polynomial approximation of NP-hard problems, probabilistic combinatorial optimization and on-line computation. He is the author of more than a 100 research papers and is a member of the editorial board of several international scientific journals.
Diese Produkte könnten Sie auch interessieren:
