Discrete Optimization
| Autor: | R. Gary Parker, Ronald L. Rardin |
|---|---|
| EAN: | 9781483294803 |
| eBook Format: | |
| Sprache: | Englisch |
| Produktart: | eBook |
| Veröffentlichungsdatum: | 28.06.2014 |
| Kategorie: | |
| Schlagworte: | combinatorial polyhedra linear programming matroids polynomial solution |
124,00 €*
Versandkostenfrei
Die Verfügbarkeit wird nach ihrer Bestellung bei uns geprüft.
Bücher sind in der Regel innerhalb von 1-2 Werktagen abholbereit.
This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.Several appendixes are included which review the fundamental ideas of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapter.