Integer and Combinatorial Optimization

George L. Nemhauser, Laurence A. Wolsey (Autoren)

Buch | Hardcover

782 Seiten

1988
John Wiley & Sons Inc (Verlag)
978-0-471-82819-8 (ISBN)

Titel ist leider vergriffen;
keine Neuauflage

Artikel merken

This advanced text/reference presents the mathematical foundations of integer and combinatorial optimization models and the algorithms that can be used to solve a variety of problems in resource allocation, location, distribution, scheduling and production. Chapters on polyhedral theory and model formulation with integer variables are included. Part 1 covers linear programming, graphs and networks and computational complexity. Part 2 covers integer programming, including duality, relaxation and strong cutting planes, and presents algorithms. Part 3 addresses combinatorial optimization, including 0-1 matrices, matching, and submodular function optimization. The book contains many examples and applications.

FOUNDATIONS: The Scope of Integer and Combinatorial Optimization; Linear Programming; Graphs and Networks; Polyhedral Theory; Computational Complexity; Polynomial-Time Algorithms for Linear Programming; Integer Lattices; GENERAL INTEGER PROGRAMMING: The Theory of Valid Inequalities; Strong Valid Inequalities and Facets for Structured Integer Programs; Duality and Relaxation; General Algorithms; Special Purpose Algorithms; Applications of Special Purpose Algorithms; COMBINATORIAL OPTIMIZATION: Integral Polyhedra; The Matching Problem; Matroid and Submodular Function Optimization; Notes; Exercises.

Erscheint lt. Verlag	24.8.1988
Reihe/Serie	Wiley-Interscience Series in Discrete Mathematics
Zusatzinfo	Ill.
Verlagsort	New York
Sprache	englisch
Maße	200 x 260 mm
Gewicht	1417 g
Themenwelt	Schulbuch / Wörterbuch ► Lexikon / Chroniken
Themenwelt	Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
ISBN-10	0-471-82819-X / 047182819X
ISBN-13	978-0-471-82819-8 / 9780471828198
Zustand	Neuware