Combinatorial Optimization: Algorithms and Complexity,New

Combinatorial Optimization: Algorithms and Complexity,New

In Stock
SKU: DADAX0131524623
Brand: Prentice Hall
Regular price$221.66
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Clearly written graduatelevel text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NPcomplete problems; approximation algorithms, local search heuristics for NPcomplete problems, more. 'Mathematicians wishing a selfcontained introduction need look no further.' American Mathematical Monthly. 1982 edition.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed