Geometric Algorithms and Combinatorial Optimization
by Martin Grötschel, László Lovász, Alexander Schrijver · Springer
Research monograph showing how the ellipsoid method and lattice basis reduction yield polynomial-time algorithms for combinatorial optimization. Establishes the equivalence of separation and optimization over polyhedra, then applies it to matroids, submodular functions, perfect graphs and other structured problems.
This link may earn us a small commission at no extra cost to you. Affiliate disclosure
More resources on Optimization
Convex Optimization
Comprehensive treatment of convex optimization theory and algorithms covering duality, approximation, statistical estimation, and geometric problems.
Principles of Optimal Control (MIT 16.323)
Deterministic and stochastic optimal control for discrete and continuous systems, covering numerical search, dynamic programming, calculus of variations, Pontryagin's maximum principle and model predictive control. Provides detailed lecture notes, problem sets, exams and programming assignments for designing optimal controllers.
Optimization Methods (MIT 15.093J)
Graduate survey of optimization algorithms: the simplex method, network flows, branch and bound and cutting planes, nonlinear optimality conditions, interior point methods, Newton's method, and dynamic programming. Provides lecture notes, problem sets and exams, emphasizing the mathematical structure behind each method.
Hands-On Mathematical Optimization with Python
Practical modeling textbook with Jupyter notebooks that formulate and solve linear, mixed-integer, network, convex/conic, robust and stochastic optimization problems in Pyomo with open-source solvers such as HiGHS. earners turn real problems into LP/MIP models and solve them with free tools before taking on the theory-heavy texts. Full content is free online.
Algorithms for Optimization
Algorithm-focused textbook with runnable Julia code for every method: gradient and second-order descent, derivative-free and stochastic search, population methods, linear constrained optimization, surrogate models, multiobjective and uncertainty-aware design optimization. Official free PDF under CC BY-NC-ND.
Integer Programming (2nd Edition)
Compact textbook on optimization with discrete variables: formulations, LP relaxations and bounds, branch-and-bound, cutting planes, branch-and-cut, Lagrangian duality, column generation, Benders' decomposition, preprocessing and heuristics as used in modern MIP solvers. It is shorter and easier to approach than Nemhauser & Wolsey.