A two-phase relaxation-based heuristic for the maximum feasible subsystem problem.
Edoardo AmaldiMaurizio BruglieriGiuliano CasalePublished in: Comput. Oper. Res. (2008)
Keyphrases
- feasible solution
- lagrangian relaxation
- linear programming relaxation
- optimal solution
- integrality gap
- optimal or near optimal
- linear programming
- data sets
- probabilistic relaxation
- neural network
- packing problem
- solution quality
- integer programming
- maximum number
- search algorithm
- constraint satisfaction
- tabu search
- simulated annealing
- special case
- combinatorial optimization
- lower bound
- lp relaxation
- computationally tractable