Get Free Shipping on orders over $0
Theory of Linear and Integer Programming : Wiley Series in Discrete Mathematics & Optimization - Alexander Schrijver

Theory of Linear and Integer Programming

By: Alexander Schrijver

Paperback | 27 April 1998 | Edition Number 1

At a Glance

Paperback


RRP $180.95

$135.75

25%OFF

or 4 interest-free payments of $33.94 with

 or 

Ships in 5 to 7 business days

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
Industry Reviews
"...a comprehensive exposition of the theory of linear and integer programming...complementing the more practically oriented books." (Zentralblatt MATH, Vol. 970, 2001/20)

More in Mathematics

Nelson WAmaths Mathematics Applications : 11th Edition - Amanda Pettitt
The Infinite Game : From the bestselling author of Start With Why - Simon Sinek
The Art of Gathering : How We Meet and Why It Matters - Priya Parker
Mathematics for Technicians : 7th Edition - Blair Alldis

RRP $94.95

$92.75

Nelson WAmaths Mathematics Applications 12 : 1st Edition - Dion Alfonsi
Nelson VicMaths 12 Foundation Maths : 1st Edition - Sue Thomson

RRP $98.95

$89.75

New Century Maths 7 Student Book : 3rd Edition - Judy Binns

RRP $76.95

$70.75

Microsoft Power BI For Dummies : For Dummies (Computer/Tech) - Jack A. Hyman
Treasury Bond Futures and Options - Owain Johnson

RRP $326.00

$280.99

14%
OFF