A first course in combinatorial optimization /
This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.
| Päätekijä: | |
|---|---|
| Aineistotyyppi: | Licensed eBooks |
| Kieli: | englanti |
| Julkaistu: |
Cambridge, UK ; New York :
Cambridge University Press,
2004.
|
| Sarja: | Cambridge texts in applied mathematics.
|
| Linkit: | https://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&AN=304474 |
Sisällysluettelo:
- 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.