A hybrid primal heuristic for finding feasible solutions to mixed integer programs.
Carlos Eduardo de AndradeShabbir AhmedGeorge L. NemhauserYufen ShaoPublished in: Eur. J. Oper. Res. (2017)
Keyphrases
- feasible solution
- mixed integer program
- linear programming
- linear program
- optimal solution
- objective function
- lagrangian relaxation
- tabu search
- solution quality
- mixed integer
- valid inequalities
- mip solver
- primal dual
- convex hull
- lot sizing
- mathematical model
- np hard
- linear programming relaxation
- infeasible solutions
- integer programming
- column generation
- dynamic programming
- cutting plane
- simulated annealing
- mathematical programming
- scheduling problem
- cost function
- genetic algorithm
- neural network