On locating new facilities in a competitive environment
- 1 January 1983
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 12 (1) , 29-35
- https://doi.org/10.1016/0377-2217(83)90180-7
Abstract
No abstract availableThis publication has 20 references indexed in Scilit:
- An $O(n\log ^2 n)$ Algorithm for the kth Longest Path in a Tree with Applications to Location ProblemsSIAM Journal on Computing, 1981
- New perspectives in competitive location theoryEuropean Journal of Operational Research, 1981
- Reducibility of minimax to minisum 0–1 programming problemsEuropean Journal of Operational Research, 1981
- Finding efficient solutions for rectilinear distance location problems efficientlyEuropean Journal of Operational Research, 1981
- Developments in network location with mobile and congested facilitiesEuropean Journal of Operational Research, 1981
- A comparative study of approaches to dynamic location problemsEuropean Journal of Operational Research, 1981
- An Algorithmic Approach to Network Location Problems. II: Thep-MediansSIAM Journal on Applied Mathematics, 1979
- An Algorithmic Approach to Network Location Problems. I: Thep-CentersSIAM Journal on Applied Mathematics, 1979
- THE LOCATION OF A CENTER‐MEDIAN CONVEX COMBINATION ON AN UNDIRECTED TREE*Journal of Regional Science, 1976
- P-Complete Approximation ProblemsJournal of the ACM, 1976