Locating flow-capturing units on a network with multi-counting and diminishing returns to scale

European Journal of Operational Research

Volumn 91, Issue 3, 1996, Pages 495-506

  Averbakh, Igor ^a   Berman, Oded ^a,b  

^a UNIVERSITY OF TORONTO   (Canada)

^b Faculty of Management   (Canada)

Author keywords

Complexity; Facilities; Heuristics; Location

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; INTEGER PROGRAMMING; NUMERICAL ANALYSIS; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; RESOURCE ALLOCATION; TREES (MATHEMATICS);

CONSUMING SERVICE; LOCATING FLOW CAPTURING UNITS; MAXIMAL LEVEL OF CONSUMPTION; MULTI COUNTING; POLYNOMIAL ALGORITHM; TRANSPORTATION NETWORK; WORST CASE ANALYSIS;

OPERATIONS RESEARCH;

EID: 0030168148     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00369-6     Document Type: Article

References (16)

1. Berman, O., Bertsimas, D., and Larson, R.C., "Locating discretionary service facilities II: Maximizing market size, minimizing inconvenience", Working Paper OR 271-92, Massachusetts Institute of Technology, November 1992.
2. Berman, O., Krass, D., and Xu, C.W., "Generalized discretionary service facility location models with probabilistic customer flows", Working Paper, University of Toronto, 1993.
3. Berman, O., Krass, D., and Xu, C.W., "Locating discretionary service facilities based on probabilistic customer flows", Transportation Science, to appear.
4. Berman, O., Larson, R., and Fouska, N., "Optimal location of discretionary service facilities", Transportation Science 26 (1992) 201-211.
5. Dial, R., "A probabilistic traffic assignment model which obviates path enumeration", Transportation Research 5 (1971) 83-111.
6. Mirchandany, P.B., and Francis, R.L. (eds.), Discrete Location Theory, Wiley, New York, 1990.
7. Hakimi, S.L., "Optimum locations of switching centers and the absolute centers and medians of a graph", Operations Research 12 (1964) 450-459.
8. Hakimi, S.L., "Optimum distribution of switching centers in a communication network and some related graph theoretic problems", Operations Research 13 (1965) 462-475.
9. Hodgson, M.J., "A flow-capturing location-allocation model", Geographical Analysis 22 (1990) 270-279.
10. Hodgson, M.J., Bhargava, M., and Parsons, A., "Location of billboards to capture passing traffic", presented at 37 ORSA/TIMS Meeting, Boston, April 24-27, 1994.
11. Hodgson, M.J., Rosing, K.E., and Storrier, A.L.G., "Applying the flow-capturing location-allocation model to realistic network traffic problems: The case of Edmonton, Canada", European Journal of Operational Research 90 (1996) 427-443.
12. Kolen, A., and Tamir, A., "Covering problems", in: P.B. Mirchandani and R.L. Francis (eds.), Discrete Location Theory Wiley, New York, 1990.
13. Mahajan, V., Muller, E., and Sharma, S., "An empirical comparison of awareness forecasting models of new product introduction", Marketing Science 3/3 (1984) 179-197.
14. Moon, I.D., and Chaudhry, S.S., "An analysis of network location problems with distance constraints", Management Science 30 (1984) 290-307.
15. Nemhauser, G.L., Wolsey, L.A., and Fisher, M.L., "An analysis of approximations for maximizing submodular set functions", Mathematical Programming 14 (1978) 265-294.
16. Papadimitriou, C.H., and Steiglitz, K., Combinatorial Optimization: Algorithms and Complexity, Prentice-Hall, Englewood Cliffs, NJ, 1982.