Combinatorial Optimization: Exact and Approximate Algorithms
by Luca Trevisan
Publisher: Stanford University 2011
Number of pages: 139
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.
Home page url
Download or read it online for free here:
by Alexander Schrijver - University of Amsterdam
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; etc.
by 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.
by 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.
by 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.