Iterative Methods in Combinatorial Optimization

Large book cover: Iterative Methods in Combinatorial Optimization

Iterative Methods in Combinatorial Optimization

Publisher: Cambridge University Press
ISBN/ASIN: 1107007518
ISBN-13: 9781107007512
Number of pages: 229

This book describes a simple and powerful method that is iterative in essence, and similarly 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 polyhedral results on matchings, trees, matroids, and flows. The presentation style is elementary enough to be accessible to anyone with exposure to basic linear algebra and graph theory.

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

Similar books

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.
Book cover: A Course in Combinatorial OptimizationA Course in Combinatorial Optimization
by - 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.
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.
Book cover: Advanced Graph Theory and Combinatorial OptimizationAdvanced Graph Theory and Combinatorial Optimization
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.