BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Theory of Linear and Integer Programming

Theory of Linear and Integer Programming

Theory of Linear and Integer Programming Paperback / softback - 1998

by Alexander Schrijver

Add to wish list
  • New
  • Paperback
New

Description

Paperback / softback. New. 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.
Ask the seller a question Add to wish list
A$173.00
A$19.00 Delivery to USA
Standard delivery: 14 to 21 days
More delivery options
Ships from The Saint Bookstore (Merseyside, United Kingdom)

Details

  • Title Theory of Linear and Integer Programming
  • Author Alexander Schrijver
  • Binding Paperback
  • Condition New
  • Pages 484
  • Volumes 1
  • Language ENG
  • Publisher Wiley, U.S.A.
  • Publication date 1998-06-11
  • Bookseller's Inventory # A9780471982326
  • ISBN 9780471982326 / 0471982326
  • Weight 1.67 lbs (0.76 kg)
  • Dimensions 9.24 x 6.39 x 1.07 in (23.47 x 16.23 x 2.72 cm)
  • Category Mathematics
  • Dewey Decimal Code 519.7
  • Quantity available 10

About The Saint Bookstore Merseyside, United Kingdom

Biblio member since 2018

The Saint Bookstore specialises in hard to find titles & also offers delivery worldwide for reasonable rates.

Terms of Sale: Refunds or Returns: A full refund of the price paid will be given if returned within 30 days in undamaged condition. If the product is faulty, we may send a replacement.

Browse books from The Saint Bookstore

Reader reviews for Theory of Linear and Integer Programming

From the publisher

Als Ergnzung zu den mehr praxisorientierten Bchern, die auf dem Gebiet der linearen und Integerprogrammierung bereits erschienen sind, beschreibt dieses Werk die zugrunde liegende Theorie und gibt einen berblick ber wichtige Algorithmen. Der Autor diskutiert auch Anwendungen auf die kombinatorische Optimierung; neben einer ausfhrlichen Bibliographie finden sich umfangreiche historische Anmerkungen.

First line

After the introduction in Section 1.1, we discuss general preliminaries (Section 1.2), preliminaries on linear algebra, matrix theory and Euclidean geometry (Section 1.3), and on graph theory (Section 1.4).

From the rear cover

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

About the author

Professor Schrijver has held tenured positions with the Mathematisch Centrum in Amsterdam, and the University of Amsterdam. He has spent leaves of absence in Oxford and Szeged (Hungary). In 1983 he was appointed to the post of Professor of Mathematics at Tilburg University, The Netherlands, with a partial engagement at the Centrum voor Wiskunde en Informatica in Amsterdam.
tracking-