A feasible rounding approach for mixed-integer optimization problems.
Christoph NeumannOliver SteinNathan Sudermann-MerxPublished in: Comput. Optim. Appl. (2019)
Keyphrases
- mixed integer
- optimization problems
- feasible solution
- objective function
- evolutionary algorithm
- metaheuristic
- tabu search
- linear programming
- benders decomposition
- linear program
- convex hull
- mixed integer programming
- lot sizing
- optimal solution
- continuous relaxation
- cost function
- network design problem
- valid inequalities
- mixed integer program
- cutting plane
- traveling salesman problem
- combinatorial optimization
- linear programming relaxation
- knapsack problem
- lagrangian relaxation
- nonlinear programming
- quadratic program
- mathematical model
- lower bound
- lagrangian heuristic
- continuous variables
- simulated annealing