Repairing MIP infeasibility through local branching.
Matteo FischettiAndrea LodiPublished in: Comput. Oper. Res. (2008)
Keyphrases
- feasible solution
- infeasible solutions
- mixed integer programming
- tabu search
- branch and bound
- linear programming
- goal programming
- objective function
- mathematical programming
- mathematical model
- search tree
- mixed integer
- lagrangian relaxation
- convex hull
- databases
- optimal solution
- column generation
- search engine
- genetic algorithm
- particle swarm optimization
- multi objective
- learning environment
- decision trees