Logo

A Course in Combinatorial Optimization

Small book cover: A Course in Combinatorial Optimization

A Course in Combinatorial Optimization
by

Publisher: University of Amsterdam
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.

Home page url

Download or read it online for free here:
Download link
(1.4MB, PDF)

Similar books

Book cover: Iterative Methods in Combinatorial OptimizationIterative Methods in Combinatorial Optimization
by - 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.
(4503 views)
Book cover: Design, Evaluation and Analysis of Combinatorial Optimization Heuristic AlgorithmsDesign, Evaluation and Analysis of Combinatorial Optimization Heuristic Algorithms
by - 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.
(3778 views)
Book cover: Advanced Graph Theory and Combinatorial OptimizationAdvanced Graph Theory and Combinatorial Optimization
by
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.
(5986 views)
Book cover: Combinatorial Optimization: Exact and Approximate AlgorithmsCombinatorial Optimization: Exact and Approximate Algorithms
by - 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.
(4991 views)