A first course in combinatorial optimization

A first course in combinatorial optimization / Jon Lee.

This self-contained beginning graduate text covers linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows.

Saved in:

Bibliographic Details
Main Author:	Lee, Jon, 1960-
Format:	eBook
Language:	English
Published:	Cambridge, UK ; New York : Cambridge University Press, 2004.
Series:	Cambridge texts in applied mathematics.
Subjects:	Combinatorial optimization. Combinatorial analysis. MATHEMATICS > Optimization. Combinatorial analysis Combinatorial optimization Kombinatorische Optimierung Combinatieleer. Optimaliseren. Matroiden. Otimização combinatória. Combinatória. Einführung.
Online Access:	Click for online access

Table of 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.