|
| 
 enlarge | Author: Alexander Schrijver
Publisher: Wiley
Category: Book
List Price: $110.00
Buy New: $87.31
You Save: $22.69 (21%)
(as of 9/6/10 06:43 PDT - Details)
New (13) Used (12) from $87.31
Rating:  4 reviews
Sales Rank: 184507
Media: Paperback
Pages: 484
Number Of Items: 1
Shipping Weight (lbs): 2.2
Dimensions (in): 9.5 x 7.4 x 1.4
ISBN: 0471982326
Dewey Decimal Number: 519
EAN: 9780471982326
ASIN: 0471982326
Publication Date: June 4, 1998
Availability: Usually ships in 1-2 business days
| |
| Also Available In:
|
| Similar Items:
| |
| Editorial Reviews:
Product 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
|
| Customer Reviews:
Good book September 22, 2007
Lei Wang (Atlanta, GA, USA)
1 out of 1 found this review helpful
This book is good. A person with a strong backgroud in mathematics can understand it well, otherwise it will take the reader some time to go through all the details.
An Eyclopedic reference for linear and integer prog. March 17, 1999
KARTIK KRISHNAN S.
7 out of 11 found this review helpful
A great reference text book, with some great historical notes about the history of both linear and integer programming.It is the first book, both me and my advisor check out, when we require any thing on Linear and Integer Programming.
Excelent book August 7, 2006
Laura B. Fernández (Tandil, Argentina)
1 out of 4 found this review helpful
It's an excelent book, but in order to use it as a classroom book I will make two improvement
1) Add an exercises section at the end of each chapter
2) Deal more extensively with Mixed Integer Linear Programming problem, e. g. add the proof of the finiteness of the Gomory's Cutting Plane Method.
 Advanced LP and IP book February 8, 2001
Sarawoot Chittratanawat
7 out of 9 found this review helpful
This book is a theoretical book -as said in title. Unless you have solid mathematic background, this book may not be for you. I said "solid" doesn't mean "a lot" or "advanced", just a simple algebra that you learn in high school -but it has to be SOLID :) I use this book in theoretical part of my thesis and dissertation but you can find other substitution though. Look at Integer and Combinatorial Optimization by Nemhauser and Wolsey, it might be more practical.
|
Certain content that appears on this site comes from Amazon Services LLC. This content is provided ‘as is’ and is subject to change or removal at any time.
Amazon and the Amazon logo are trademarks of Amazon.com, Inc. or its affiliates.
|
|
|
|
|
| |
