This book treats the fundamental issues and algorithmic strategies emerging as the core of the discipline of discrete optimization in a comprehensive and rigorous fashion. Following an introductory chapter on computational complexity, the basic algorithmic results for the two major models of polynomial algorithms are introduced--models using matroids and linear programming. Further chapters treat the major non-polynomial algorithms: branch-and-bound and cutting planes. The text concludes with a chapter on heuristic algorithms.
Several appendixes are included which review the fundamental ideas of linear programming, graph theory, and combinatorics--prerequisites for readers of the text. Numerous exercises are included at the end of each chapter.
"synopsis" may belong to another edition of this title.
Accessible to students, researchers, and instructors, this work would be valuable both for a university course in discrete optimization and as a reference book. The references are good and up to date.
--COMPUTING REVIEWS
The book is cleary and beautifully written. It is a very useful reference on the subject and can be used as an advanced graduate text for courses in combinatorial or discrete optimization.
--MATHEMATICAL REVIEWS
I can unreservedly recommend this book to any lecturer preparing a course building on an introductory course on basic linear and network programming. It finds its deserved place next to my favorite textbooks on linear, integer, and combinatorial optimization.
--Uwe Zimmermann
In a single volume, they succeed in covering most of the important basic and advanced material. I can unreservedly recommend this book to any lecturer preparing a course building on an introductory course on basic linear and network programming. The book's strength lies in its succinct introductions to the valuable ideas that are treated more verbosely in the specialized books. It finds its deserved place next to my favorite textbooks on linear, integer, and combinatorial optimization.
--SIAM REVIEW
"About this title" may belong to another edition of this title.
Shipping:
US$ 15.54
From United Kingdom to U.S.A.
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Dust jacket in poor condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:0125450753. Seller Inventory # 8247792
Quantity: 1 available
Seller: Anybook.com, Lincoln, United Kingdom
Condition: Good. This is an ex-library book and may have the usual library/used-book markings inside.This book has hardback covers. In good all round condition. Please note the Image in this listing is a stock photo and may not match the covers of the actual item,900grams, ISBN:0125450753. Seller Inventory # 3947653
Quantity: 1 available
Seller: BookDepart, Shepherdstown, WV, U.S.A.
Hardcover. Condition: UsedGood. Hardcover, a volume in Computer Science and Scientific Computing; surplus library copy with the usual stampings; reference number taped to spine; bar code on back cover; fading and shelf wear to exterior; corners bumped; otherwise contents in good condition with clean text, firm binding. Seller Inventory # 51352
Quantity: 1 available
Seller: BennettBooksLtd, North Las Vegas, NV, U.S.A.
hardcover. Condition: New. In shrink wrap. Looks like an interesting title! Seller Inventory # Q-0125450753
Quantity: 1 available
Seller: dsmbooks, Liverpool, United Kingdom
Hardcover. Condition: Very Good. Very Good. book. Seller Inventory # D7S9-1-M-0125450753-6
Quantity: 1 available