Maximizing the service area: A criterion to choose optimal solution in the location of set covering problem.
Kun ZhangSonglin ZhangPublished in: Geoinformatics (2015)
Keyphrases
- set covering problem
- optimal solution
- branch and bound algorithm
- column generation
- set covering
- integer programming
- branch and bound
- lower bound
- objective function
- feasible solution
- np hard
- web services
- linear program
- knapsack problem
- linear programming
- search space
- physical location
- test problems
- solution quality
- bi objective
- metaheuristic
- exact solution