A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering.

Egon Balas Maria C. Carrera

Published in: Oper. Res. (1996)

Keyphrases

set covering
column generation
branch and bound procedure
branch and bound
integer programming
set covering problem
dynamic environments
search algorithm
cutting plane
dynamically changing
hypergraph model
data sets
lagrangian relaxation
optimization methods
integer program
linear programming
lower bound
case study