Rounding and Propagation Heuristics for Mixed Integer Programming.
Tobias AchterbergTimo BertholdGregor HendelPublished in: OR (2011)
Keyphrases
- mixed integer programming
- mixed integer
- linear programming relaxation
- lot sizing
- valid inequalities
- network design problem
- column generation
- cutting plane
- production planning
- linear program
- dantzig wolfe decomposition
- feasible solution
- lagrangian relaxation
- optimal solution
- convex hull
- heuristic search
- approximation algorithms
- search algorithm
- linear programming
- lower bound
- continuous variables
- probabilistic model
- evolutionary algorithm
- high dimensional