You are here

Theory of Linear and Integer Programming

Alexander Schrijver (Paperback - Jun 4, 1998)
Publisher: 
John Wiley
Publication Date: 
1998
Number of Pages: 
484
Format: 
Paperback
Price: 
90.00
ISBN: 
978-0471982326
Category: 
Monograph
BLL Rating: 

The Basic Library List Committee recommends this book for acquisition by undergraduate mathematics libraries.

There is no review yet. Please check back later.

Introduction and Preliminaries.

Problems, Algorithms, and Complexity.

LINEAR ALGEBRA.

Linear Algebra and Complexity.

LATTICES AND LINEAR DIOPHANTINE EQUATIONS.

Theory of Lattices and Linear Diophantine Equations.

Algorithms for Linear Diophantine Equations.

Diophantine Approximation and Basis Reduction.

POLYHEDRA, LINEAR INEQUALITIES, AND LINEAR PROGRAMMING.

Fundamental Concepts and Results on Polyhedra, Linear Inequalities, and Linear Programming.

The Structure of Polyhedra.

Polarity, and Blocking and Anti-Blocking Polyhedra.

Sizes and the Theoretical Complexity of Linear Inequalities and Linear Programming.

The Simplex Method.

Primal-Dual, Elimination, and Relaxation Methods.

Khachiyan's Method for Linear Programming.

The Ellipsoid Method for Polyhedra More Generally.

Further Polynomiality Results in Linear Programming.

INTEGER LINEAR PROGRAMMING.

Introduction to Integer Linear Programming.

Estimates in Integer Linear Programming.

The Complexity of Integer Linear Programming.

Totally Unimodular Matrices: Fundamental Properties and Examples.

Recognizing Total Unimodularity.

Further Theory Related to Total Unimodularity.

Integral Polyhedra and Total Dual Integrality.

Cutting Planes.

Further Methods in Integer Linear Programming.

References.

Indexes.

Dummy View - NOT TO BE DELETED