ISBN: 9780486414539 - Combinatorial Optimization: Networks and Matroids (dover Books on Mathematics) (16 results)
Language: English
Published by Dover Publications, 2011
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: New
US$ 17.81
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Dover Publishers, 2011
- Softcover
Seller: INDOO, Avenel, NJ, U.S.A.INDOO
Contact seller5-star sellerCondition: New
US$ 20.46
Free ShippingShips within U.S.A.Quantity: Over 20 available
Condition: New. Brand New.
Language: English
Published by Dover Publications, 2011
- Softcover
Seller: Lakeside Books, Benton Harbor, MI, U.S.A.Lakeside Books
Contact seller5-star sellerCondition: New
US$ 16.97
US$ 3.99 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New. Brand New! Not Overstocks or Low Quality Book Club Editions! Direct From the Publisher! We're not a giant, faceless warehouse organization! We're a small town bookstore that loves books and loves it's customers! Buy from Lakeside Books.
Language: English
Published by Dover Publications 11/10/2011, 2011
- Softcover
Seller: BargainBookStores, Grand Rapids, MI, U.S.A.BargainBookStores
Contact seller5-star sellerCondition: New
US$ 21.65
Free ShippingShips within U.S.A.Quantity: 5 available
Paperback or Softback. Condition: New. Combinatorial Optimization: Networks and Matroids. Book.
Language: English
Published by Dover Publications, 2011
- Softcover
Seller: GreatBookPrices, Columbia, MD, U.S.A.GreatBookPrices
Contact seller5-star sellerCondition: Used - As new
US$ 20.20
US$ 2.64 shippingShips within U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Dover Publications Inc., New York, 2003
- Softcover
Seller: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contact seller5-star sellerCondition: New
US$ 25.87
Free ShippingShips within U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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. Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.…
Language: English
Published by Dover Publications, 2011
- Softcover
Seller: California Books, Miami, FL, U.S.A.California Books
Contact seller5-star sellerCondition: New
US$ 25.00
US$ 3.00 shippingShips within U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Dover Publications 2003-03-28, 2003
- Softcover
Seller: Chiron Media, Wallingford, United KingdomChiron Media
Contact seller5-star sellerCondition: New
US$ 24.90
US$ 6.69 shippingShips from United Kingdom to U.S.A.Quantity: 20 available
Paperback. Condition: New. Brand new book, sourced directly from publisher. Dispatch time is 7-8 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.
Language: English
Published by Dover Publications, 2001
- Softcover
Seller: Revaluation Books, Exeter, United KingdomRevaluation Books
Contact seller5-star sellerCondition: New
US$ 28.28
US$ 13.41 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Paperback. Condition: Brand New. reprint edition. 374 pages. 8.75x5.00x1.00 inches. In Stock.
Language: English
Published by Dover Publications, 2011
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: New
US$ 27.38
US$ 20.11 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: New.
Language: English
Published by Dover Publications, 2011
- Softcover
Seller: GreatBookPricesUK, Woodford Green, United KingdomGreatBookPricesUK
Contact seller5-star sellerCondition: Used - As new
US$ 28.56
US$ 20.11 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Condition: As New. Unread book in perfect condition.
Language: English
Published by Dover Publications Nov 2011, 2011
- Softcover
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
US$ 37.15
US$ 39.17 shippingShips from Germany to U.S.A.Quantity: 2 available
Taschenbuch. Condition: Neu. Neuware - Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity.…
Language: English
Published by DOVER PUBN INC, 2011
- Softcover
Seller: moluna, Greven, Germanymoluna
Contact seller5-star sellerCondition: New
US$ 27.69
US$ 54.83 shippingShips from Germany to U.S.A.Quantity: Over 20 available
Condition: New. InhaltsverzeichnisrnrnPrefacen Chapter 1 INTRODUCTIONn Chapter 2 MATHEMATICAL PRELIMINARIES nChapter 3 SHORTEST PATHS nChapter 4 NETWORK FLOWS n Chapter 5 BIPARTITE MATCHING nChapter 6 NONBIPARTITE MATCHING n Chapter 7 MATROIDS AND THE GR.
Language: English
Published by Dover Publications Inc., 2011
- Softcover
- Print on Demand
Seller: THE SAINT BOOKSTORE, Southport, United KingdomTHE SAINT BOOKSTORE
Contact seller5-star sellerCondition: New
US$ 27.41
US$ 20.27 shippingShips from United Kingdom to U.S.A.Quantity: Over 20 available
Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
Language: English
Published by Dover Publications Inc., New York, 2003
- Softcover
- Print on Demand
Seller: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contact seller5-star sellerCondition: New
US$ 37.55
US$ 37.00 shippingShips from Australia to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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. Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.…
Language: English
Published by Dover Publications Inc., New York, 2003
- Softcover
- Print on Demand
Seller: CitiRetail, Stevenage, United KingdomCitiRetail
Contact seller5-star sellerCondition: New
US$ 33.82
US$ 49.61 shippingShips from United Kingdom to U.S.A.Quantity: 1 available
Paperback. Condition: new. Paperback. 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. Perceptive text examines shortest paths, network flows, bipartite and nonbipartite matching, matroids and the greedy algorithm, matroid intersections, and the matroid parity problems. Suitable for courses in combinatorial computing and concrete computational complexity. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…
