Combinatorial optimization par lawler eugene (22 résultats)

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

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

hardcover. Etat : Good.

Etat : New.

Hardcover. Etat : Fair. No Jacket. Missing dust jacket; Readable copy. Pages may have considerable notes/highlighting. ~ ThriftBooks: Read More, Spend Less.

Etat : New. Brand New.

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

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

Etat : As New. Unread book in perfect condition.

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

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

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

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.

Etat : New.

Etat : As New. Unread book in perfect condition.

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.