Login / Signup
A Modified Greedy Heuristic for the Set Covering Problem with Improved Worst Case Bound.
Olivier Goldschmidt
Dorit S. Hochbaum
Gang Yu
Published in:
Inf. Process. Lett. (1993)
Keyphrases
</>
greedy heuristic
set covering problem
set covering
branch and bound algorithm
np hard
greedy algorithm
integer programming
column generation
optimal solution
lower bound
bi objective
knapsack problem
linear programming
branch and bound
combinatorial optimization
neural network
upper bound