Simulating realistic set covering problems with known optimal solutions.
Nabin SapkotaCharles H. ReillyPublished in: Comput. Ind. Eng. (2011)
Keyphrases
- set covering problem
- optimal solution
- branch and bound algorithm
- column generation
- set covering
- bi objective
- branch and bound
- integer programming
- efficient solutions
- np hard
- lower bound
- linear program
- search space
- real world
- knapsack problem
- upper bound
- solution quality
- objective function
- feasible solution
- test problems
- real life
- neural network
- total cost
- linear programming
- search algorithm