Discrete Optimization
by Guido Schaefer
Publisher: Utrecht University 2012
Number of pages: 97
Description:
From the table of contents: Preliminaries (Optimization Problems); Minimum Spanning Trees; Matroids; Shortest Paths; Maximum Flows; Minimum Cost Flows; Matchings; Integrality of Polyhedra; Complexity Theory; Approximation Algorithms.
Download or read it online for free here:
Download link
(multiple formats)
Similar books
The Design of Approximation Algorithmsby D. P. Williamson, D. B. Shmoys - Cambridge University Press
This book shows how to design approximation algorithms: efficient algorithms that find provably near-optimal solutions. It is organized around techniques for designing approximation algorithms, including greedy and local search algorithms.
(16382 views)
Notes on Optimizationby Pravin Varaiya - Van Nostrand
The author presents the main concepts mathematical programming and optimal control to students having diverse technical backgrounds. A reasonable knowledge of advanced calculus, linear algebra, and linear differential equations is required.
(12192 views)
Applied Mathematical Programmingby S. Bradley, A. Hax, T. Magnanti - Addison-Wesley
This book shows you how to model a wide array of problems. Covered are topics such as linear programming, duality theory, sensitivity analysis, network/dynamic programming, integer programming, non-linear programming, and my favorite, etc.
(19992 views)
Convex Optimization: Algorithms and Complexityby Sebastien Bubeck - arXiv.org
This text presents the main complexity theorems in convex optimization and their algorithms. Starting from the fundamental theory of black-box optimization, the material progresses towards recent advances in structural and stochastic optimization.
(6688 views)