Stock photo: cover may vary
Theory of Linear and Integer Programming Paperback - 1998
by Schrijver, Alexander
- New
A$124.64
A$7.08
Delivery within USA
Standard delivery: 5 to 8 days
More delivery options
Standard delivery: 5 to 8 days
Ships from The Book Forest (California, United States)
Details
- Title Theory of Linear and Integer Programming
- Author Schrijver, Alexander
- Binding Paperback
- Condition New
- Pages 484
- Volumes 1
- Language ENG
- Publisher Wiley, U.S.A.
- Publication date 1998-06-11
- Bookseller's Inventory # BAY_03_SH_080621
- 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 1
About The Book Forest California, United States
Biblio member since 2006
The Book Forest has been selling books on the internet since 2004, with a 98% customer approval rating on other internet book selling venues. At The Book Forest we never mislead customers on the condition of a book so that we might make a sale, and we ship all our orders within 24 hours of receiving them. We also have a 100% money back guarantee, and we handle questions and concerns within a few hours of receiving them.
Reader reviews for Theory of Linear and Integer Programming
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
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
