| 000 -LEADER |
|---|
| fixed length control field |
nam a22 4500 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
|---|
| fixed length control field |
230903b xxu||||| |||| 00| 0 eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
|---|
| International Standard Book Number |
9780521189439 |
| 082 ## - DEWEY DECIMAL CLASSIFICATION NUMBER |
|---|
| Classification number |
518.26 |
| Item number |
LAU |
| 100 ## - MAIN ENTRY--PERSONAL NAME |
|---|
| Personal name |
Lau, Lap Chi |
| 245 ## - TITLE STATEMENT |
|---|
| Title |
Iterative methods in combinatorial optimization |
| 260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
|---|
| Name of publisher, distributor, etc |
Cambridge University Press, |
| Date of publication, distribution, etc |
2011 |
| Place of publication, distribution, etc |
Cambridge : |
| 300 ## - PHYSICAL DESCRIPTION |
|---|
| Extent |
xi, 242 p. ; |
| Other physical details |
ill., |
| Dimensions |
23 cm |
| 365 ## - TRADE PRICE |
|---|
| Price amount |
42.99 |
| Price type code |
GBP |
| Unit of pricing |
110.40 |
| 490 ## - SERIES STATEMENT |
|---|
| Series statement |
Cambridge texts in applied mathematics |
| 504 ## - BIBLIOGRAPHY, ETC. NOTE |
|---|
| Bibliography, etc |
Includes bibliographical references and index. |
| 520 ## - SUMMARY, ETC. |
|---|
| Summary, etc |
With the advent of approximation algorithms for NP-hard combinatorial optimization problems, several techniques from exact optimization such as the primal-dual method have proven their staying power and versatility. This book describes a simple and powerful method that is iterative in essence and similarly useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory, making the book suitable for introductory courses in combinatorial optimization at the upper undergraduate and beginning graduate levels. Discussions of advanced applications illustrate their potential for future application in research in approximation algorithms. |
| 650 ## - SUBJECT ADDED ENTRY--TOPICAL TERM |
|---|
| Topical term or geographic name as entry element |
Data processing |
|
|---|
| Topical term or geographic name as entry element |
Combinatorial optimization |
|
|---|
| Topical term or geographic name as entry element |
Bipartite Graphs |
|
|---|
| Topical term or geographic name as entry element |
Generalized Assignment Problem |
|
|---|
| Topical term or geographic name as entry element |
Spanning Trees |
|
|---|
| Topical term or geographic name as entry element |
Matroid Intersection |
|
|---|
| Topical term or geographic name as entry element |
Duality and Min-Max Theorem |
|
|---|
| Topical term or geographic name as entry element |
Integrality |
|
|---|
| Topical term or geographic name as entry element |
Graph Matching |
|
|---|
| Topical term or geographic name as entry element |
Vertex Cove |
|
|---|
| Topical term or geographic name as entry element |
Discrepancy Theorem |
|
|---|
| Topical term or geographic name as entry element |
Bin Packing |
| 700 ## - ADDED ENTRY--PERSONAL NAME |
|---|
| Personal name |
Ravi, R. |
|
|---|
| Personal name |
Singh, Mohit |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) |
|---|
| Source of classification or shelving scheme |
|
| Item type |
Books |