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

Skip to content

Combinatorial Optimization

Combinatorial Optimization

Combinatorial Optimization
Stock photo: cover may vary

Combinatorial Optimization Paperback - 2011

by Lawler, Eugene,

Add to wish list
  • Used
New

Description

like new.
Ask the seller a question Add to wish list
A$24.12
A$5.66 Delivery within USA
Standard delivery: 2 to 14 days
More delivery options
Ships from GreatBookPrices (Maryland, United States)
The BIBLIO Guarantee

Details

  • Title Combinatorial Optimization
  • Author Lawler, Eugene,
  • Binding Paperback
  • Edition Reprint
  • Condition New
  • Pages 384
  • Volumes 1
  • Language ENG
  • Publisher Dover Publications
  • Publication date 2011-11-10
  • Bookseller's Inventory # 439552
  • ISBN 9780486414539 / 0486414531
  • Weight 0.89 lbs (0.40 kg)
  • Dimensions 8.48 x 5.36 x 0.76 in (21.54 x 13.61 x 1.93 cm)
  • Category Mathematics
  • Library of Congress subjects Network analysis (Planning), Algorithms
  • Library of Congress Catalogue Number 00060242
  • Dewey Decimal Code 519
  • Quantity available 5

About GreatBookPrices Maryland, United States

Biblio member since 2024

Since 1991, we have worked every day to serve our customers with state-of-the-art technology and world class service. We are dedicated to providing customers around the world with the widest selection of books, DVDs, and CDs at the absolute lowest price.

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 GreatBookPrices

Reader reviews for Combinatorial Optimization

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

Perceptively written text examines optimization problems that can be formulated in terms of networks and algebraic structures called matroids. Chapters cover shortest paths, network flows, bipartite matching, nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. A suitable text or reference for courses in combinatorial computing and concrete computational complexity in departments of computer science and mathematics.

Media reviews

Citations

  • Scitech Book News, 09/01/2001, Page 48

Please wait a moment while we load the requested page.

tracking-