Theory of linear and integer programming (Record no. 1711)
[ view plain ]
000 -LEADER | |
---|---|
fixed length control field | 03974nam a22001937a 4500 |
005 - DATE AND TIME OF LATEST TRANSACTION | |
control field | 20220304145304.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
fixed length control field | 220304b ||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
International Standard Book Number | 9780471982326 |
082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER | |
Classification number | 519.72 |
Item number | SCH |
100 ## - MAIN ENTRY--PERSONAL NAME | |
Personal name | Schrijver, Alexander |
245 ## - TITLE STATEMENT | |
Title | Theory of linear and integer programming |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) | |
Name of publisher, distributor, etc. | John Wiley & Sons, Inc. |
Place of publication, distribution, etc. | Chichester |
Date of publication, distribution, etc. | 2000 |
300 ## - PHYSICAL DESCRIPTION | |
Extent | xi, 471 p. |
365 ## - TRADE PRICE | |
Price type code | USD |
Price amount | 132.00 |
504 ## - BIBLIOGRAPHY, ETC. NOTE | |
Bibliography, etc. note | TABLE OF CONTENTS<br/>Introduction and Preliminaries.<br/><br/>Problems, Algorithms, and Complexity.<br/><br/>LINEAR ALGEBRA.<br/><br/>Linear Algebra and Complexity.<br/><br/>LATTICES AND LINEAR DIOPHANTINE EQUATIONS.<br/><br/>Theory of Lattices and Linear Diophantine Equations.<br/><br/>Algorithms for Linear Diophantine Equations.<br/><br/>Diophantine Approximation and Basis Reduction.<br/><br/>POLYHEDRA, LINEAR INEQUALITIES, AND LINEAR PROGRAMMING.<br/><br/>Fundamental Concepts and Results on Polyhedra, Linear Inequalities, and Linear Programming.<br/><br/>The Structure of Polyhedra.<br/><br/>Polarity, and Blocking and Anti-Blocking Polyhedra.<br/><br/>Sizes and the Theoretical Complexity of Linear Inequalities and Linear Programming.<br/><br/>The Simplex Method.<br/><br/>Primal-Dual, Elimination, and Relaxation Methods.<br/><br/>Khachiyan's Method for Linear Programming.<br/><br/>The Ellipsoid Method for Polyhedra More Generally.<br/><br/>Further Polynomiality Results in Linear Programming.<br/><br/>INTEGER LINEAR PROGRAMMING.<br/><br/>Introduction to Integer Linear Programming.<br/><br/>Estimates in Integer Linear Programming.<br/><br/>The Complexity of Integer Linear Programming.<br/><br/>Totally Unimodular Matrices: Fundamental Properties and Examples.<br/><br/>Recognizing Total Unimodularity.<br/><br/>Further Theory Related to Total Unimodularity.<br/><br/>Integral Polyhedra and Total Dual Integrality.<br/><br/>Cutting Planes.<br/><br/>Further Methods in Integer Linear Programming.<br/><br/>References.<br/><br/>Indexes. |
520 ## - SUMMARY, ETC. | |
Summary, etc. | DESCRIPTION<br/>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 |
650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM | |
Topical term or geographic name as entry element | Linear programming |
942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
Source of classification or shelving scheme | Dewey Decimal Classification |
Koha item type | Book |
Withdrawn status | Lost status | Source of classification or shelving scheme | Damaged status | Not for loan | Collection code | Bill No | Bill Date | Home library | Current library | Shelving location | Date acquired | Source of acquisition | Cost, normal purchase price | Total Checkouts | Full call number | Accession Number | Date last seen | Copy number | Cost, replacement price | Price effective from | Koha item type |
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Dewey Decimal Classification | Operations Management & Quantitative Techniques | 548/21-22 | 25-02-2022 | Indian Institute of Management LRC | Indian Institute of Management LRC | General Stacks | 03/04/2022 | T V Enterprises | 6865.09 | 519.72 SCH | 002087 | 03/04/2022 | 1 | 10441.20 | 03/04/2022 | Book |