Login / Signup
An adaptation of SH heuristic to the location set covering problem.
Marcos Almiñana
Jesús T. Pastor
Published in:
Eur. J. Oper. Res. (1997)
Keyphrases
</>
set covering problem
set covering
branch and bound algorithm
column generation
integer programming
bi objective
optimal solution
branch and bound
lower bound
multi objective
efficient solutions
pareto local search
lagrangian relaxation
linear program
upper bound
np hard
search algorithm