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

Combinatorial Optimization : Algorithms and Complexity Paperback - 1998

by Kenneth Steiglitz; Christos H. Papadimitriou

Add to wish list
  • Used
  • Good
  • Paperback
Used - Good

Description

Dover Publications, Incorporated, 1998. Paperback. Good. Disclaimer:Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less.Dust jacket quality is not guaranteed.
Ask the seller a question Add to wish list
A$12.68
Free Delivery within USA
Standard delivery: 4 to 8 days
More delivery options
Ships from ThriftBooks (Washington, United States)
Biblio Top Seller
The BIBLIO Guarantee

Details

  • Title Combinatorial Optimization : Algorithms and Complexity
  • Author Kenneth Steiglitz; Christos H. Papadimitriou
  • Binding Paperback
  • Edition Unabridged
  • Condition Used - Good
  • Pages 528
  • Volumes 1
  • Language ENG
  • Publisher Dover Publications, Incorporated, Mineola, New York, U.S.A.
  • Publication date 1998
  • Bookseller's Inventory # G0486402584I3N00
  • 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 ThriftBooks Washington, United States

Biblio member since 2018

From the largest selection of used titles, we put quality, affordable books into the hands of readers

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 ThriftBooks

Reader reviews for Combinatorial Optimization : Algorithms and Complexity

Write a review for this book

There are no reviews for this book yet. Be the first to write a review!

Your review will be anonymous unless you login or create an account first.

Overall rating
Remember: You’re rating the book as a work, not the seller or the condition of the specific copy you purchased!

Important Terms and Guidelines

  • Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
  • Reviews must be at least 140 characters in length.
  • Please do not reveal critical plot elements.
  • This is not a help line. Contact customer support if you need help.
Your review must not include:
  • Obscenities, discriminatory language, or other insulting language not suitable for public domain
  • Advertisements, “spam” content, or references to other products, offers or websites.
  • Email addresses, URLs, phone numbers, physical addresses or other contact information.
  • Overly critical comments about other reviews or reviewers
  • Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
  • Availability, price, or alternative ordering/shipping information

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.

Please wait a moment while we load the requested page.

tracking-