A Course in Combinatorial Optimization
by Alexander Schrijver
Publisher: University of Amsterdam 2012
Number of pages: 221
Description:
Contents: Shortest paths and trees; Polytopes, polyhedra, Farkas' lemma, and linear programming; Matchings and covers in bipartite graphs; Menger's theorem, flows, and circulations; Nonbipartite matching; Problems, algorithms, and running time; Cliques, stable sets, and colourings; Integer linear programming and totally unimodular matrices; Multicommodity flows and disjoint paths; Matroids.
Download or read it online for free here:
Download link
(1.4MB, PDF)
Similar books
Design, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithmsby Daniel Karapetyan - arXiv
Different aspects of heuristics design and evaluation are discussed. A broad spectrum of related subjects, covered in this research, includes test bed generation and analysis, implementation and performance issues, and more.
(7907 views)
Advanced Graph Theory and Combinatorial Optimizationby Alexander Schrijver
From the table of contents: Shortest trees and branchings; Matchings and covers; Edge-colouring; Multicommodity flows and disjoint paths; Matroids; Perfect matchings in regular bipartite graphs; Minimum circulation of railway stock.
(11680 views)
Combinatorial Optimization: Exact and Approximate Algorithmsby Luca Trevisan - Stanford University
In this course we study algorithms for combinatorial optimization problems, the type of algorithms that arise in countless applications. The following 18 lectures cover topics in approximation algorithms, exact optimization, and online algorithms.
(9301 views)
Iterative Methods in Combinatorial Optimizationby Lap Chi Lau, R. Ravi, M. Singh - Cambridge University Press
This book describes a simple method that is iterative in essence, and useful in a variety of settings for exact and approximate optimization. The authors highlight the commonality and uses of this method to prove a variety of classical results.
(8787 views)