From
ThriftBooks-Dallas, Dallas, TX, U.S.A.
Seller rating 5 out of 5 stars
AbeBooks Seller since 2 July 2009
Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less. Seller Inventory # G0030848660I3N00
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.
Title: Combinatorial Optimization: Networks and ...
Publisher: Oxford University Press
Publication Date: 1995
Binding: Hardcover
Condition: Good
Dust Jacket Condition: No Jacket
Seller: Antiquariat Bookfarm, Löbnitz, Germany
Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 90 LAW 9780030848667 Sprache: Englisch Gewicht in Gramm: 1150. Seller Inventory # 2506847
Seller: Buchpark, Trebbin, Germany
Condition: Sehr gut. Zustand: Sehr gut | Seiten: 384 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. Seller Inventory # 41818187/202
Seller: Kloof Booksellers & Scientia Verlag, Amsterdam, Netherlands
Condition: as new. New York & London : Holt, Rinehart and Winston, [1976]. Hardcover. x,374 pp. ills. 24cm. Condition : as new copy. ISBN 9780030848667. Keywords : MATHEMATICS, Seller Inventory # 300191
Quantity: 1 available
Seller: BGV Books LLC, Murray, KY, U.S.A.
Condition: Good. Exact ISBN match. Immediate shipping. No funny business. Seller Inventory # 9780030848667
Seller: Fables Books, Goshen, IN, U.S.A.
Condition: acceptable. Significant shelf, storage or usage wear present that does not affect the readability of the boo, including moderately heavy water damage. A former library book with all the expected stamps, stickers and markings. No dustjacket included, as pictured. The pages appear aged but unmarked. Staining on the cover and page edges. Hinges are intact. The binding is intact and all pages are present. Pictures available upon request. Individually inspected by Shay. Thanks for supporting an independent bookseller! Seller Inventory # FBV.0030848660.A
Seller: About Books, Henderson, NV, U.S.A.
Hardcover. Condition: Very Good condition. First Printing of the First Edition. New York: Holt, Rinehart and Winston, 1976. Very Good condition. Square, tight, unmarked copy. Lower corner of cover slightly bumped (not creasing or otherwise affecting any pages). Old price on rear cover. Scarce in Hardcover. No owner's name or bookplate. No remainder mark. No underlining. No highlighting. Illustrated with line drawings and diagrams. Index. 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." . First Printing of the First Edition. Hardcover. Very Good condition. 8vo. x, 374pp . Seller Inventory # 010032