Integer and Combinatorial Optimization / Edition 1

Integer and Combinatorial Optimization / Edition 1

ISBN-10:
0471359432
ISBN-13:
9780471359432
Pub. Date:
07/08/1999
Publisher:
Wiley
ISBN-10:
0471359432
ISBN-13:
9780471359432
Pub. Date:
07/08/1999
Publisher:
Wiley
Integer and Combinatorial Optimization / Edition 1

Integer and Combinatorial Optimization / Edition 1

$202.95 Current price is , Original price is $202.95. You
$202.95 
  • SHIP THIS ITEM
    Qualifies for Free Shipping
  • PICK UP IN STORE
    Check Availability at Nearby Stores
$62.77 
  • SHIP THIS ITEM

    Temporarily Out of Stock Online

    Please check back later for updated availability.

    • Condition: Good
    Note: Access code and/or supplemental material are not guaranteed to be included with used textbook.

Overview

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.

Product Details

ISBN-13: 9780471359432
Publisher: Wiley
Publication date: 07/08/1999
Series: Wiley Series in Discrete Mathematics and Optimization , #55
Pages: 784
Product dimensions: 7.10(w) x 10.00(h) x 1.60(d)

About the Author

LAURENCE A. WOLSEY is Professor of Applied Mathematics at the Center for Operations Research and Econometrics at l'Universite Catholique de Louvain at Louvain-la-Neuve, Belgium. He is the author, with George Nemhauser, of Integer and Combinatorial Optimization.

GEORGE NEMHAUSER is an A. Russell Chandler III Chair and Institute Professor in the H. Milton Stewart School of Industrial and Systems Engineering at Georgia Tech.

Table of Contents

FOUNDATIONS.

The Scope of Integer and Combinatorial Optimization.

Linear Programming.

Graphs and Networks.

Polyhedral Theory.

Computational Complexity.

Polynomial-Time Algorithms for Linear Programming.

Integer Lattices.

GENERAL INTEGER PROGRAMMING.

The Theory of Valid Inequalities.

Strong Valid Inequalities and Facets for Structured Integer Programs.

Duality and Relaxation.

General Algorithms.

Special-Purpose Algorithms.

Applications of Special- Purpose Algorithms.

COMBINATORIAL OPTIMIZATION.

Integral Polyhedra.

Matching.

Matroid and Submodular Function Optimization.

References.

Indexes.
From the B&N Reads Blog

Customer Reviews