← All resourcesOptimization via Relaxation and Decomposition
This book offers an up-to-date description of relaxation/approximation and decomposition techniques, demonstrating how their combined use efficiently solves large-scale optimization problems relevant to engineering, particularly in electrical, and industrial engineering, with a focus on energy.
Visit Optimization via Relaxation and Decomposition ↗
- Optimizing with Column GenerationBookAn interesting book about Column Generation to tackle large-scale optimization problems
- Modern LP Book - DualityBookA discussion about books focused on duality theory
- SBBSolverSBB is a GAMS solver for Mixed Integer Nonlinear Programming
(MINLP) models. It is based on a combination of the standard Branch and Bound (B&B) method known from Mixed Integer Linear Programming and some of the standard NLP solvers already supported by GAMS. SBB can use
all GAMS NLP solvers as subsolvers but it works best with NLP solvers that can utilize a near optimal point as a starting point like Conopt, Minos, and Snopt.SBB supports all types of discrete variables supported by GAMS, including Binary, Integer, Semicont, Semiint, Sos1, and Sos2.
- HiGHSSolverHiGHS is open-source software to solve linear programming (LP), mixed-integer programming (MIP), and convex quadratic programming (QP) models.
- Land-Doig CompetitionChallengeThe 2026 Land-Doig MIP Competition is a computational competition hosted by the 2026 Mixed Integer Programming Workshop, offering an opportunity for teams to showcase their practical and computational prowess and fostering innovation in computational MIP. It is named in honor of Ailsa H. Land and Alison G. Harcourt (née Doig), who proposed the first LP-based branch-and-bound algorithm.
- Marco LübbeckeContent creatorProfessor of operations research at RWTH Aachen University.