Live briefing
Everything about Linear programming relaxation
Concept in integral mathematics
In mathematics, the relaxation of a (mixed) integer linear program is the problem that arises by removing the integrality constraint of each variable. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Linear programming relaxationA 5-minute orientation
- Skim a recent paper: Operation Optimization Adapting to Active Distribution Networks Under Three-Phase Unbalanced Conditions: Parametric Linear Relaxation ProgrammingInfluential work since 2022
- Pick up a classic book: Topics in relaxation and ellipsoidal methodsThe most-reprinted book on the subject
- Read the landmark paper: An all-linear programming relaxation algorithm for optimizing over the efficient setCited 71 times
- Go sideways: Branch and cutA closely related topic
- Go sideways: Randomized roundingA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🏆 Landmark papers (most cited)
An all-linear programming relaxation algorithm for optimizing over the efficient set
Generalized bilinear programming: Part I. Models, applications and linear programming relaxation
Global optimization of signomial geometric programming using linear relaxation
Two-Level Linear Relaxation Method for Generalized Linear Fractional Programming
A Linear Programming Relaxation for Binary Tomography with Smoothness Priors
A global optimization using linear relaxation for generalized geometric programming
A relaxation method for solving problems of non-linear programming
Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
🆕 Influential since 2022
Operation Optimization Adapting to Active Distribution Networks Under Three-Phase Unbalanced Conditions: Parametric Linear Relaxation Programming
Hybrid Algorithm of Linear Programming Relaxation and Quantum Annealing
A global optimization approach utilizing convex relaxation for linear multiplicative programming problems
Global optimization of quadratic fractional programming using linear relaxation method
Author Correction: Surrogate “Level-Based” Lagrangian Relaxation for mixed-integer linear programming
📚 Books worth reading
Topics in relaxation and ellipsoidal methodsM. Akgül · 1984
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Branch and cut Branch and cut is a method of combinatorial optimization for solving integer linear programs (ILPs), that is, linear programming (LP) problems where some…
- Randomized rounding In computer science and operations research, randomized rounding is a widely used approach for designing and analyzing approximation algorithms. Many combinator…
- Approximation algorithm In computer science and operations research, approximation algorithms are efficient algorithms that find approximate solutions to optimization problems…
- Set cover problem The set cover problem is a classical question in combinatorics, computer science, operations research, and complexity theory. Given a set of elements {1…
- Relaxation (approximation) In mathematical optimization and related fields, relaxation is a modeling strategy. A relaxation is an approximation of a difficult problem by a nearby…
- Column generation Column generation or delayed column generation is an efficient algorithm for solving large linear programs. The overarching idea is that many linear programs…
- Karmarkar–Karp bin packing algorithms The Karmarkar–Karp (KK) bin packing algorithms are several related approximation algorithm for the bin packing problem. The bin packing problem is a problem…
- Integer programming An integer programming, also known as integer optimization, problem is a mathematical optimization or feasibility program in which some or all of the variables…