Description: Combinatorial Optimization by Christos H. Papadimitriou Estimated delivery 4-14 business days Format Paperback Condition Brand New Description This graduate-level text considers the Soviet ellipsoid algorithm for linear programming; efficient algorithms for network flow, matching, spanning trees, and matroids; the theory of NP-complete problems; local search heuristics for NP-complete problems, more. 1982 edition. Publisher Description 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. Author Biography Christos H. Papadimitriou is C. Lester Hogan Professor of Electrical Engineering and Computer Sciences at the University of California, Berkeley, where he has taught since 1996 and where he is a former Miller Fellow. Details ISBN 0486402584 ISBN-13 9780486402581 Title Combinatorial Optimization Author Christos H. Papadimitriou Format Paperback Year 2000 Pages 528 Edition New edition Publisher Dover Publications Inc. GE_Item_ID:583969; About Us Grand Eagle Retail is the ideal place for all your shopping needs! With fast shipping, low prices, friendly service and over 1,000,000 in stock items - you're bound to find what you want, at a price you'll love! Shipping & Delivery Times Shipping is FREE to any address in USA. Please view eBay estimated delivery times at the top of the listing. Deliveries are made by either USPS or Courier. We are unable to deliver faster than stated. International deliveries will take 1-6 weeks. NOTE: We are unable to offer combined shipping for multiple items purchased. This is because our items are shipped from different locations. Returns If you wish to return an item, please consult our Returns Policy as below: Please contact Customer Services and request "Return Authorisation" before you send your item back to us. Unauthorised returns will not be accepted. Returns must be postmarked within 4 business days of authorisation and must be in resellable condition. Returns are shipped at the customer's risk. We cannot take responsibility for items which are lost or damaged in transit. For purchases where a shipping charge was paid, there will be no refund of the original shipping charge. Additional Questions If you have any questions please feel free to Contact Us. Categories Baby Books Electronics Fashion Games Health & Beauty Home, Garden & Pets Movies Music Sports & Outdoors Toys
Price: 35.12 USD
Location: Calgary, Alberta
End Time: 2024-11-13T04:33:28.000Z
Shipping Cost: 0 USD
Product Images
Item Specifics
Restocking Fee: No
Return shipping will be paid by: Buyer
All returns accepted: Returns Accepted
Item must be returned within: 30 Days
Refund will be given as: Money Back
ISBN-13: 9780486402581
Book Title: Combinatorial Optimization
Number of Pages: 528 Pages
Publication Name: Combinatorial Optimization : Algorithms and Complexity
Language: English
Publisher: Dover Publications, Incorporated
Item Height: 1 in
Subject: Machine Theory, Combinatorics, Optimization
Publication Year: 1998
Type: Textbook
Item Weight: 21.7 Oz
Item Length: 8.5 in
Subject Area: Mathematics, Computers
Author: Kenneth Steiglitz, Christos H. Papadimitriou
Series: Dover Books on Computer Science Ser.
Item Width: 5.5 in
Format: Trade Paperback