Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Für diesen Artikel ist leider kein Bild verfügbar.

Discrete Optimization

Buch | Hardcover
472 Seiten
1988
Academic Press Inc (Verlag)
978-0-12-545075-1 (ISBN)
CHF 174,55 inkl. MwSt
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
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.

Introduction to Discrete Optimization. Computational Complexity. Polynomial Algorithms-Matroids Enumeration Algorithms. Polynomial Algorithms. Linear Programming Nonpolynomial algorithims-Partial Enumeration Nonpolynomial Algorithims-Polyhedral Description Nonexact Algorithms Vector Matrices and Convex Sets Graph Theory Fundamentals Linear Programming Fundamentals.

Erscheint lt. Verlag 1.11.1988
Reihe/Serie Computer Science and Scientific Computing
Verlagsort San Diego
Sprache englisch
Gewicht 450 g
Themenwelt Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-12-545075-3 / 0125450753
ISBN-13 978-0-12-545075-1 / 9780125450751
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Numbers and Counting, Groups, Graphs, Orders and Lattices

von Volker Diekert; Manfred Kufleitner; Gerhard Rosenberger …

Buch | Softcover (2023)
De Gruyter (Verlag)
CHF 89,95