Combinatorial optimization par lawler eugene (24 résultats)

Paperback. Etat : As New. No Jacket. Pages are clean and are not marred by notes or folds of any kind. ~ ThriftBooks: Read More, Spend Less.

Etat : acceptable. Used - Acceptable: All pages and the cover are intact, but shrink wrap, dust covers, or boxed set case may be missing. Pages may include limited notes, highlighting, or minor water damage but the text is readable. Pages may include limited notes and highlighting, but the text cannot be obscured or unreadable. Any access codes or passwords originally included with the book may be expired, used or no longer valid. Image is stock photo and cover art edition may be different than pictured.…

paperback. Etat : Very Good. This book is from an inventory that we have been able to price inexpensively because it has minimal description. All of the books from this inventory are in very good condition or better, with the potential for light shelf-wear; many are particularly nice examples. May have a small remainder mark at textblock edge.…

Etat : New.

Etat : New. Brand New.

Etat : Acceptable. Item in acceptable condition! Textbooks may not include supplemental items i.e. CDs, access codes etc.

hardcover. Etat : Good.

Paperback or Softback. Etat : New. Combinatorial Optimization: Networks and Matroids. Book.

Etat : 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.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : Good. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Etat : 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.…

Etat : Good. Exact ISBN match. Immediate shipping. No funny business.

Hardcover. Etat : 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 .…

Paperback. Etat : Brand New. reprint edition. 374 pages. 8.75x5.00x1.00 inches. In Stock.

Paperback. Etat : New.

Etat : New.

Etat : As New. Unread book in perfect condition.

Etat : as new. New York & London : Holt, Rinehart and Winston, [1976]. Hardcover. x,374 pp. ills. 24cm. Condition : as new copy. ISBN 9780030848667. Keywords : MATHEMATICS.

Hardcover. Etat : Gut. 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.…

Taschenbuch. Etat : 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.…

Etat : 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.

Etat : Sehr gut. Zustand: Sehr gut | Seiten: 384 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.