MATH 523 Combinatorial Optimization 2017
fall
Instructor: Jozsef Solymosi,
Office: MATH 220,
solymosi@math.ubc.ca
Grading: Homework assignments 40%, Take home
midterm 20%, take home final 40%.
TueThu: 14:00 AM to 15:30
PM in MATX-1118
Office hours: by appointment (send me an email)
Topics:
¥ Shortest
paths and trees
o Shortest paths with
nonnegative lengths
o DijkstraÕs
algorithm
o Minimum spanning
trees
o Traveling salesmanÕs
problem
¥ Polytopes,
polyhedra, FarkasÕ lemma,
and linear programming
o Convex sets
o Polytopes and polyhedra
o FarkasÕ lemma
o Linear
programming
¥ Matchings
and covers in bipartite graphs
o Matchings and
covers
o Augmenting
paths
o KoenigÕs
theorems
¥ MengerÕs theorem, flows, and circulations
o MengerÕs theorem
o Flows in
networks
o Finding a maximum
flow
¥ Semidefinite
Programming (selected topics)
Notes:
¥ ÒUnderstanding
and Using Linear ProgrammingÓ and ÒApproximation Algorithms and
Semidefinite ProgrammingÓ by J.Matousek and B.Gartner,
Springer. UBC library eBooks
¥ A. Schrijver, ÒA Course in Combinatorial
OptimizationÓ Schrijver
¥ L. Lovasz, ÒSemidefinite optimizationÓ Lovasz
Further readings:
o Beating Christofides by Sitters and Stougie
Problem sets: