Local Branching Relaxation Heuristics for Integer Linear Programs.
Taoan HuangAaron M. FerberYuandong TianBistra DilkinaBenoit SteinerPublished in: CoRR (2022)
Keyphrases
- linear program
- linear programming
- extreme points
- mixed integer
- integer variables
- objective function
- lp relaxation
- continuous relaxation
- stochastic programming
- interior point methods
- semi infinite
- optimal solution
- simplex method
- column generation
- lagrangian relaxation
- dynamic programming
- branch and bound
- integer program
- np hard
- integer solution
- primal dual
- linear inequalities
- linear programming problems
- strongly polynomial
- dual variables
- nelder mead
- quadratic program
- linear programming relaxation
- interior point
- mixed integer linear program
- search algorithm
- simplex algorithm
- semidefinite
- convex relaxation
- convex functions
- integer programming
- optimization problems
- evolutionary algorithm
- market equilibrium
- genetic algorithm