Theory of Linear and Integer Programming

Free shipping with 3 or more products in your cart
Payflex: Pay in 4 interest-free payments of R1,057.75. Read the FAQ
R 4,231
In stock
Duties, insurance and VAT included
Delivered in 10–20 working days —
Free shipping with 3 or more products in your cart
Secure checkout
Your payment is fully protected
Duties & VAT included
No surprise charges at the door
Tracked delivery
Track your order end to end
Returns support
30-day return window

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

Technical Specifications
Height
23.8 cm
Length
15.6 cm
Width
2.7 cm
Weight
1.7 kg
Release date
4 June 1998
Shipping & Delivery

Your order is shipped from the USA and delivered to your door in South Africa in 10–20 working days. All items are fully tracked.

Returns & Exchanges

We offer a 30-day return window. If something isn't right, contact our support team and we'll make it right.