A Lagrangian-based heuristic for large-scale set covering problems.

Sebastián Ceria Paolo Nobili Antonio Sassano

Published in: Math. Program. (1998)

Keyphrases

set covering problem
set covering
duality gap
lagrangian relaxation
branch and bound algorithm
column generation
integer programming
optimal solution
bi objective
real world
search strategies
real life
cost function
np hard
combinatorial optimization
neural network
numerical methods
lower bound