A first course in combinatorial optimization [electronic resource] / Jon Lee.

By: Contributor(s): Material type: TextTextSeries: Cambridge texts in applied mathematicsPublication details: Cambridge, UK ; New York : Cambridge University Press, 2004.Description: xvi, 211 p. : illSubject(s): Genre/Form: DDC classification:
  • 519.6/4 22
LOC classification:
  • QA402.5 .L394 2004eb
Online resources:
Contents:
Polytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&-Bound -- 8. Optimizing Submodular Functions.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
No physical items for this record

Includes bibliographical references (p. 207-208) and indexes.

Polytopes and Linear Programming -- 1. Matroids and the Greedy Algorithm -- 2. Minimum-Weight Dipaths -- 3. Matroid Intersection -- 4. Matching -- 5. Flows and Cuts -- 6. Cutting Planes -- 7. Branch-&-Bound -- 8. Optimizing Submodular Functions.

Electronic reproduction. Palo Alto, Calif. : ebrary, 2009. Available via World Wide Web. Access may be limited to ebrary affiliated libraries.

There are no comments on this title.

to post a comment.