Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints-Reference-Cited by-同舟云学术

Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints

Published:1998-12 Issue:2 Volume:6 Page:179-194
ISSN:1134-5764
Container-title:Top
language:en
Short-container-title:Top

Author:

Carrizosa Emilio,Plastria Frank

Publisher

Springer Science and Business Media LLC

Subject

Discrete Mathematics and Combinatorics,Statistics and Probability,Management Science and Operations Research,Information Systems and Management,Modelling and Simulation

Link

http://link.springer.com/content/pdf/10.1007/BF02564786.pdf

Reference9 articles.

1. Carrizosa, E. and F. Plastria (1995). On minquantile and maxcovering optimisation.Mathematical Programming,71, 101–112.

2. Chazelle, B. and D.T. Lee (1986). On a circle placement problem.Computing,36, 1–16.

3. Church, R. and C. ReVelle (1974). Maximal covering location problem.Papers of Regional Science Association,32, 101–118.

4. Drezner, Z. (1981). On a modified one-center model.Management Science,27, 848–851.

5. Durier, R. and C. Michelot (1985). Geometrical properties of the Fermat-Weber problem.European Journal of Operational Research,20, 332–343.

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

1. Solving the 1-median problem on a network with continuous demand and demand surplus;Computers & Operations Research;2023-12

2. A local analysis to determine all optimal solutions of p-k-max location problems on networks;Discrete Applied Mathematics;2021-06

3. A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover;European Journal of Operational Research;2017-11

4. Location Problems;Paradigms of Combinatorial Optimization;2014-08-08

5. General Bibliography;Paradigms of Combinatorial Optimization;2014-08-08