A First Course in Combinatorial Optimization
A First Course in Combinatorial Optimization is a text for a one-semester introductory graduate-level course for students of operations research, mathematics, and computer science. It is a self-contained treatment of the subject, requiring only some mathematical maturity. Topics include: linear and integer programming, polytopes, matroids and matroid optimization, shortest paths, and network flows. Central to the exposition is the polyhedral viewpoint, which is the key principle underlying the successful integer-programming approach to combinatorial-optimization problems. Another key unifying topic is matroids. The author does not dwell on data structures and implementation details, preferring to focus on the key mathematical ideas that lead to useful models and algorithms. Problems and exercises are included throughout as well as references for further study.
What people are saying - Write a review
We haven't found any reviews in the usual places.
Other editions - View all
augmenting path basic solution Bellman-Ford Algorithm bipartite graph Branch-&-Bound cardinality characteristic vector Cjxj column combinatorial optimization combinatorial-optimization problems consider convex convex hull Cutting-Plane Method cycle define dicycle digraph Dijkstra's Algorithm Dual Simplex Method Duality Theorem edges of G efficient algorithm elements endpoint equations example extreme points Farkas Lemma feasible solution finding a minimum-weight Gomory cutting planes graph G graphic matroid Greedy Algorithm independent set integer linear program knapsack program Lemma Let G linear inequalities linear-programming relaxation linearly independent lower bound matching of G matrix Matroid-Intersection maximal maximum-cardinality matching minimal minimum-weight v-w dipath nonnegative number of edges odd-set cover optimal solution perfect matching planar polytope problem of finding Proof satisfies Simplex Method solving spanning tree subgradient submodular function subproblem subprogram subset Suppose T-join totally unimodular undirected graph upper bound v e V(G variables Vertex packing w-tree weight function