BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Combinatorial Optimization: Algorithms and Complexity

Combinatorial Optimization: Algorithms and Complexity

Click to view full size.

Combinatorial Optimization: Algorithms and Complexity Paperback - 1998

by Christos H. Papadimitriou and Kenneth Steiglitz

Add to wish list
  • Used
  • Paperback
New

Description

Dover Publications, 1998. FIRST THUS. Paperback. Like New/No Jacket. First Edition Thus, First Printing. Not price-clipped. Published by Dover Publications, 1998. Octavo. Paperback. Book is like new with edge wear. 100% positive feedback. 30 day money back guarantee. NEXT DAY SHIPPING! Excellent customer service. Please email with any questions. All books packed carefully and ship with free delivery confirmation/tracking. All books come with free bookmarks. Ships from Sag Harbor, New York.
Ask the seller a question Add to wish list
A$28.36
A$5.66 Delivery within USA
Standard delivery: 3 to 6 days
More delivery options
Ships from Southampton Books (New York, United States)

Details

  • Title Combinatorial Optimization: Algorithms and Complexity
  • Author Christos H. Papadimitriou and Kenneth Steiglitz
  • Binding Paperback
  • Edition FIRST THUS
  • Condition New
  • Pages 528
  • Volumes 1
  • Language ENG
  • Publisher Dover Publications, Mineola, New York, U.S.A.
  • Publication date 1998
  • Bookseller's Inventory # 368391
  • ISBN 9780486402581 / 0486402584
  • Weight 1.17 lbs (0.53 kg)
  • Dimensions 8.47 x 5.48 x 1.04 in (21.51 x 13.92 x 2.64 cm)
  • Category Mathematics
  • Library of Congress subjects Mathematical optimization, Computational complexity
  • Library of Congress Catalogue Number 98021476
  • Dewey Decimal Code 519
  • Quantity available 1

About Southampton Books New York, United States

Biblio member since 2022

Southampton Books & Sag Harbor Books - Independent bookstores located in the villages of Southampton & Sag Harbor, New York. Selling new and collectible books in all categories. We Buy Books! Do you have books to sell? Call or email or visit our website. Collections - Libraries - Individual Titles.

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Southampton Books

Reader reviews for Combinatorial Optimization: Algorithms and Complexity

From the publisher

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.
tracking-