An empirical evaluation of a walk-relax-round heuristic for mixed integer convex programs.
Kuo-Ling HuangSanjay MehrotraPublished in: Comput. Optim. Appl. (2015)
Keyphrases
- mixed integer
- convex programs
- mixed integer programming
- mixed integer program
- optimal solution
- feasible solution
- lagrangian heuristic
- linear program
- benders decomposition
- convex functions
- lot sizing
- convex hull
- network design problem
- tabu search
- lagrangian relaxation
- objective function
- continuous variables
- branch and bound
- linear programming
- combinatorial optimization
- dynamic programming
- search algorithm
- mathematical model
- optimization problems
- simulated annealing
- multistage
- lower bound