On the complexity of surrogate and group relaxation for integer linear programs.
Trivikram DokkaAdam N. LetchfordM. Hasan MansoorPublished in: Oper. Res. Lett. (2021)
Keyphrases
- linear program
- linear programming
- extreme points
- objective function
- semi infinite
- simplex method
- optimal solution
- lp relaxation
- primal dual
- worst case
- linear programming problems
- column generation
- mixed integer
- np hard
- interior point methods
- computational complexity
- integer variables
- integer solution
- continuous relaxation
- mixed integer linear program
- strongly polynomial
- dynamic programming
- stochastic programming
- interior point
- market equilibrium
- dual variables
- linear inequalities
- linear programming relaxation
- iterative algorithms
- feasible solution
- multistage
- lower bound