Edge covering with continuous location along the network
The set covering problem is to find the minimum cardinality set of locations to site the facilities which cover all of the demand points in the network. In this classical problem, it is assumed that the potential facility locations and the demand points are limited to the set of vertices. Although t...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Growing Science
2020-06-01
|
| Series: | International Journal of Industrial Engineering Computations |
| Subjects: | |
| Online Access: | http://www.growingscience.com/ijiec/Vol11/IJIEC_2020_8.pdf |