Covering Problems-Reference-Cited by-同舟云学术

Covering Problems

Published:2011 Issue: Volume: Page:109-135
ISSN:0884-8289
Container-title:International Series in Operations Research & Management Science
language:
Short-container-title:

Author:

Snyder Lawrence V.

Publisher

Springer US

Link

http://link.springer.com/content/pdf/10.1007/978-1-4419-7572-0_6

Reference44 articles.

1. Aytug H, Saydam C (2002) Solving large-scale maximum expected covering location problems by genetic algorithms: a comparative study. Eur J Oper Res 141:480–494

2. Batta R, Dolan JM, Krishnamurthy NN (1989) The maximal expected covering location problem revisited. Transp Sci 23:277–287

3. Berman O, Krass D (2002) Facility location problems with stochastic demands and congestion. In: Drezner Z, Hamacher HW (eds) Facility location: applications and theory. Springer, New York (Chapter 11)

4. Bramel J, Simchi-Levi D (1997) On the effectiveness of set covering formulations for the vehicle routing problem with time windows. Oper Res 45:295–301

5. Church R (1974) Synthesis of a class of public facilities location models. PhD thesis, The Johns Hopkins University, Baltimore

Cited by 35 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient presolving methods for solving maximal covering and partial set covering location problems;European Journal of Operational Research;2023-11

2. A Benders decomposition algorithm for the maximum availability service facility location problem;Computers & Operations Research;2023-01

3. Stochastic Gradual Covering Location Models;International Series in Operations Research & Management Science;2023

4. Efficient Heuristics for a Partial Set Covering Problem with Mutually Exclusive Pairs of Facilities;Springer Proceedings in Mathematics & Statistics;2023

5. Solving location‐allocation problems with professional optimization software;Transactions in GIS;2022-11