- Home
- Mathematics
- Combinatorics
- Combinatorial Optimization (Algorithms and Complexity)
Combinatorial Optimization (Algorithms and Complexity)
List Price:
$30.00
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
Christos H. Papadimitriou, Kenneth Steiglitz
Format:
Paperback
Pages:
528
Publisher:
Dover Publications (January 29, 1998)
Language:
English
ISBN-13:
9780486402581
ISBN-10:
0486402584
Weight:
21.68oz
Dimensions:
5.5" x 8.5"
Case Pack:
16
Series:
Dover Books on Computer Science
File:
Dover-Dover_11012026_P10825292_onix30_Complete-20261101.xml
As low as:
$28.50
List Price:
$30.00
Publisher Identifier:
P-DOVER
Discount Code:
D
Audience:
College/higher education
Pub Discount:
65
Imprint:
Dover Publications
Folder:
Dover
Overview
This clearly written, mathematically rigorous text includes a novel algorithmic exposition of the simplex method and also discusses the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; approximation algorithms, local search heuristics for NP-complete problems, more. All chapters are supplemented by thought-provoking problems. A useful work for graduate-level students with backgrounds in computer science, operations research, and electrical engineering. "Mathematicians wishing a self-contained introduction need look no further." — American Mathematical Monthly.
