Search Books
Practical Statistics and Ex… The Chemistry of Enols (PAT…

Theory of Linear and Integer Programming (Wiley Series in Discrete Mathematics and Optimization)

Author Alexander Schrijver
Publisher Wiley
Category Mathematics
📄 Viewing lite version Full site ›
🌎 Shop on Amazon — choose country
357.00 USD
🛒 Buy New on Amazon 🇺🇸 🏷 Buy Used — $78.87
Share:
Book Details
PublisherWiley
ISBN / ASIN0471908541
ISBN-139780471908548
Sales Rank3,276,390
CategoryMathematics
MarketplaceUnited States 🇺🇸

Description

Theory of Linear and Integer Programming Alexander Schrijver Centrum voor Wiskunde en Informatica, Amsterdam, The Netherlands This book describes the theory of linear and integer programming and surveys the algorithms for linear and integer programming problems, focusing on complexity analysis. It aims at complementing the more practically oriented books in this field. A special feature is the author's coverage of important recent developments in linear and integer programming. Applications to combinatorial optimization are given, and the author also includes extensive historical surveys and bibliographies. The book is intended for graduate students and researchers in operations research, mathematics and computer science. It will also be of interest to mathematical historians. Contents 1 Introduction and preliminaries; 2 Problems, algorithms, and complexity; 3 Linear algebra and complexity; 4 Theory of lattices and linear diophantine equations; 5 Algorithms for linear diophantine equations; 6 Diophantine approximation and basis reduction; 7 Fundamental concepts and results on polyhedra, linear inequalities, and linear programming; 8 The structure of polyhedra; 9 Polarity, and blocking and anti-blocking polyhedra; 10 Sizes and the theoretical complexity of linear inequalities and linear programming; 11 The simplex method; 12 Primal-dual, elimination, and relaxation methods; 13 Khachiyan's method for linear programming; 14 The ellipsoid method for polyhedra more generally; 15 Further polynomiality results in linear programming; 16 Introduction to integer linear programming; 17 Estimates in integer linear programming; 18 The complexity of integer linear programming; 19 Totally unimodular matrices: fundamental properties and examples; 20 Recognizing total unimodularity; 21 Further theory related to total unimodularity; 22 Integral polyhedra and total dual integrality; 23 Cutting planes; 24 Further methods in integer linear programming; Historical and further notes on integer linear programming; References; Notation index; Author index; Subject index
The Nonlinear Schrödinger Equation: Singular Solutions…
View
Selected Papers II (Springer Collected Works in Mathem…
View
Algebra and Trigonometry
View
Chaos and Fractals: New Frontiers of Science
View
Fisher, Neyman, and the Creation of Classical Statisti…
View
Precalculus: Concepts Through Functions Right Triangle…
View
The Theory of Linear Models and Multivariate Analysis
View
Polyhedron Models
View