Minisum collection depots location problem with multiple facilities on a network

Journal of the Operational Research Society

Volumn 55, Issue 7, 2004, Pages 769-779

  Berman, O ^b   Huang, R ^a  

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Branch and bound; Lagrangian relaxation; Location; Networks

Indexed keywords

AMBULANCES; BOUNDARY VALUE PROBLEMS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; HOSPITALS; LAGRANGE MULTIPLIERS; LOCATION; MATHEMATICAL MODELS; MATHEMATICAL PROGRAMMING; PROBLEM SOLVING; THEOREM PROVING;

BRANCH AND BOUND; LAGRANGIAN RELAXATION; MINISUM PROBLEM; OPTIMAL SOLUTIONS;

OPERATIONS RESEARCH;

EID: 3042837767     PISSN: 01605682     EISSN: None     Source Type: Journal    
DOI: 10.1057/palgrave.jors.2601742     Document Type: Conference Paper

References (12)

1. Drezner Z and Wesolowsky GO (2001). On the collection depots location problem. Eur J Opl Res 130: 510-518.
2. Berman O, Drezner Z and Wesolowsky GO (2002). The collection depots location problem on networks. Nav Res Log 49: 15-24.
3. Berlin GN, ReVelle CS and Elzinga DJ (1976). Determining ambulance-hospital locations for on-scene and hospital services. Environ Plann A 8: 553-561.
4. Tamir A and Halman N (2003). One-way and round-trip center location problem. Working Paper Statistics Department, Tel Aviv University, Israel.
5. Mirchandani PB and Francis RL (eds) (1990). Discrete Location Theory. Wiley: New York.
6. Narula SC, Ogbu UI and Samuelsson HM (1977). An algorithm for the p-median problem. Opns Res 25: 709-713.
7. Daskin MS (1995). Network and Discrete Location: Models, Algorithms and Applications. John Wiley & Sons: New York.
8. Cornuejols G, Fisher ML and Nemhauser GL (1977). Location of bank accounts to optimize float: an analytic study of exact and approximate algorithms. Mngt Sci 23: 789-810.
9. Pirkul H and Schilling DA (1991). The maximal covering location problem with capacities on total workload. Mngt. Sci 37: 233-248.
10. Fisher ML (1981). The Lagrangian relaxation method for solving integer programming problems. Mngt. Sci 27: 1-18.
11. Crowder H (1976). Computational improvements for subgradient optimization. Symp Math 19: 357-372.
12. Goffin JL (1977). On convergence of rates of subgradient optimization methods. Math Prog 13: 329-347.