Integer and Combinatorial Optimization by Laurence A. Wolsey, Laurence A. Wolsey, George L. Nemhauser

BUY IT NEW

  • $140.95 List price
    $111.15 Online price
    $100.04 Member price
    (Save 29%)
    Limited Time Offer! Everyone receives the Member Price on books.
    See Details
    • skip to cart
  • Add To List uiAction=GetAllLists&page=List&pageType=list&ean=9780471359432&productCode=BK&maxCount=100&threshold=3

GET FREE SHIPPING ON ORDERS OF $25 OR MORE

DELIVERY & GIFT DETAILS:

Usually ships within 24 hours

Delivery Time and Shipping Rates

Eligible for gift wrap & gift message.

BUY IT USED

12 copies from $100.16

See All Available

Textbook (Paperback - New Edition)

  • 784pp
  • Sales Rank: 236,152

Textbook Information

  • ISBN-13: 9780471359432
  • Edition Description: New Edition
  • Edition Number: 1
  • Pub. Date: July 1999
  • Publisher: Wiley, John & Sons, Incorporated

Reader Rating:

See All Detailed Ratings

Buy it Used: 12 copies from $100.16 See All Available

Customers who bought this also bought

 
  • Overview
  • Editorial Reviews
  • Features

Product Details

  • Pub. Date: July 1999
  • Publisher: Wiley, John & Sons, Incorporated
  • Format: Textbook Paperback, 784pp
  • Sales Rank: 236,152

Synopsis

Rave reviews for INTEGER AND COMBINATORIAL OPTIMIZATION

"This book provides an excellent introduction and survey of traditional fields of combinatorial optimization . . . It is indeed one of the best and most complete texts on combinatorial optimization . . . available. [And] with more than 700 entries, [it] has quite an exhaustive reference list."-Optima

"A unifying approach to optimization problems is to formulate them like linear programming problems, while restricting some or all of the variables to the integers. This book is an encyclopedic resource for such formulations, as well as for understanding the structure of and solving the resulting integer programming problems."-Computing Reviews

"[This book] can serve as a basis for various graduate courses on discrete optimization as well as a reference book for researchers and practitioners."-Mathematical Reviews

"This comprehensive and wide-ranging book will undoubtedly become a standard reference book for all those in the field of combinatorial optimization."-Bulletin of the London Mathematical Society

"This text should be required reading for anybody who intends to do research in this area or even just to keep abreast of developments."-Times Higher Education Supplement, London

Also of interest . . .

INTEGER PROGRAMMING Laurence A. Wolsey Comprehensive and self-contained, this intermediate-level guide to integer programming provides readers with clear, up-to-date explanations on why some problems are difficult to solve, how techniques can be reformulated to give better results, and how mixed integer programming systems can be used more effectively. 1998(0-471-28366-5) 260 pp.

Booknews

This graduate textbook focuses on the mathematical underpinnings of the algorithms that make it possible to solve the large and complex models that arise in practical applications. The three parts cover the foundations of discrete optimization theory and techniques, general integer programming, and highly structured combinatorial optimization problems. A reprint of the 1988 edition. Annotation c. Book News, Inc., Portland, OR (booknews.com)

More Reviews and Recommendations

Customer Reviews

  • Reader Rating:

Be the first to write a review!