Finding Feasible Solutions to Hard Mixed-integer Programming Problems Using Hybrid Heuristics.
Philipp ChristophelLeena SuhlUwe H. SuhlPublished in: OR (2005)
Keyphrases
- feasible solution
- mixed integer programming problems
- heuristic solution
- linear programming
- infeasible solutions
- tabu search
- objective function
- optimal solution
- solution quality
- mixed integer
- lagrangian relaxation
- solution space
- convex hull
- linear programming relaxation
- mathematical model
- mixed integer program
- search algorithm
- benchmark problems
- search space
- extreme points
- high dimensional
- integer solution