Integer and Combinatorial Optimization / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $54.15
Usually ships in 1-2 business days
(Save 69%)
Other sellers (Hardcover)
  • All (3) from $54.15   
  • Used (3) from $54.15   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$54.15
Bookbyte-OR
Seller since 2002

Feedback rating:

(11326)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

Acceptable
All text is legible, may contain markings, cover wear, loose/torn pages or staining and much writing. SKU:9780471828198-5-0

Ships from: Salem, OR

Usually ships in 1-2 business days

  • •Canadian
  • •International
  • •Standard, 48 States
  • •Standard (AK, HI)
  • •Express, 48 States
  • •Express (AK, HI)
$122.10
Black Oak Books Holdings Corp. CA
Seller since 2008

Feedback rating:

(24)

Condition: Good
1988 H hardcover Good in J Good jacket Jacket lightly sunned/soiled/rubbed, corners very lightly bumped/rubbed, spine ends lightly bumped/rubbed; cover lightly bumped/soiled, ... spine ends bumped; edges very lightly soiled; binding tight; cover, edges, and interior all intact and clean except as noted. Due to the size/weight of this item, additional shipping charges on International and Expedited orders may apply. Read more Show Less

Ships from: Berkeley, CA

Usually ships in 1-2 business days

  • •Canadian
  • •International
  • •Standard, 48 States
  • •Standard (AK, HI)
  • •Express, 48 States
  • •Express (AK, HI)
$325.09
Extremely_Reliable
Seller since 2007

Feedback rating:

(7872)

Condition: Very Good
Buy with confidence. Excellent Customer Service & Return policy.

Ships from: Richmond, TX

Usually ships in 1-2 business days

  • •Canadian
  • •International
  • •Standard, 48 States
  • •Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

More About This Textbook

Overview

This advanced text/reference is the most current, comprehensive treatment on the topic available. Presents the mathematical foundations of integer and combinatorial optimization models and the algorithms that can be used to solve a rich variety of problems in resource allocation, location, distribution, scheduling, and production. Includes chapters on polyhedral theory and model formulation with integer variables. Part I covers linear programming, graphs and networks, and computational complexity. Part II covers integer programming, including duality, relaxation and strong cutting planes, and presents algorithms. Part III addresses combinatorial optimization, including 0-1 matrices, matching, and submodular function optimization. Contains many examples and applications.
Read More Show Less

Editorial Reviews

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
Read More Show Less

Product Details

Table of Contents

Pt. I Foundations 1
I.1 The Scope of Integer and Combinatorial Optimization 3
I.2 Linear Programming 27
I.3 Graphs and Networks 50
I.4 Polyhedral Theory 83
I.5 Computational Complexity 114
I.6 Polynomial-Time Algorithms for Linear Programming 146
I.7 Integer Lattices 182
Pt. II General Integer Programming 203
II.1 The Theory of Valid Inequalities 205
II.2 Strong Valid Inequalities and Facets for Structured Integer Programs 259
II.3 Duality and Relaxation 296
II.4 General Algorithms 349
II.5 Special-Purpose Algorithms 383
II.6 Applications of Special-Purpose Algorithms 433
Pt. III Combinatorial Optimization 533
III.1 Integral Polyhedra 535
III.2 Matching 608
III.3 Matroid and Submodular Function Optimization 659
References 721
Author Index 749
Subject Index 755
Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Review Guidelines
Add Recommendations
Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously
    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)