Author:
Labbé Martine,Laporte Gilbert,Rodríguez-Martín Inmaculada
Reference33 articles.
1. Balas, E. and A. Ho. (1980). Set Covering Algorithms using Cutting Planes, Heuristics and Subgradient Optimization: A Computational Study. Mathematical Programming, 12:37–60.
2. Church, R. and J. Current. (1993). Maximal Covering Tree Problems. Naval Research Logistics, 40:129–142.
3. Current, J. (1988). The Design of a Hierarchical Transportation Network with Transshipment Facilities. Transportation Science, 22:270–277.
4. Current, J., J.L. Cohon and C.S. ReVelle. (1984). The Shortest Covering Path Problem: An Application of Locational Constraints to Network Design. Journal of Regional Science, 24:161–183.
5. Current, J., H. Pirkul and E. Rolland. (1994). Efficient Algorithms for Solving the Shortest Covering Path Problem. Transportation Science, 28:317–327.
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献