Uncapacitated facility location problem with client matching

Operations Research

Volumn 48, Issue 5, 2000, Pages 671-685

  Gourdin, Éric ^a   Labbé, Martine ^a   Laporte, Gilbert ^b  

^a UNIVERSITÉ LIBRE DE BRUXELLES   (Belgium)

^b UNIVERSITÉ DE MONTRÉAL   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; MATHEMATICAL MODELS; PROBLEM SOLVING;

CLIENT MATCHING; UNCAPACITATED FACILITY LOCATION PROBLEM (UFLP);

OPERATIONS RESEARCH;

EID: 0034262342     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.48.5.671.12410     Document Type: Article

References (17)

1. Cornuéjols, G., G. L. Nemhauser, L. A. Wolsey. 1990. The uncapacitated facility location problem. P. B. Mirchandani, R. L. Francis, eds. Discrete Location Theory. Wiley, New York, 119-171.
2. _, J.-M. Thizy. 1982. Some facets of the simple plant location polytope. Math. Programming 23 50-74.
3. CPLEX OPTIMIZATION, INC. 1994. Using the CPLEX callable library and CPLEX mixed integer library.
4. Christofides, N. 1985. Vehicle routing. E. L. Lawler, J. K. Lenstra, A. H. G. Rinnooy Kan, D. B. Shmoys, eds. The Traveling Salesman Problem. Wiley, Chichester, UK, 431-448.
5. Cook, W., A. Rohe. 1996. "Blossom4," computer code for minimum-weight perfect matching available at http://www.or. uni-bonn.de/home/rohe/matching.html.
6. Current, J. R., C. A. Weber. 1994. Application of facility location modeling constructs to vendor selection problems. Eur. J. Oper. Res. 76 387-392.
7. Edmonds, J. 1965. Maximum matching and a polyhedron with 0,1-vertices. J. Res. National Bureau of Standards 69B 125-130.
8. Fisher, M. L. 1995. Vehicle routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing, Handbooks in Operations Research and Management Sciences, Volume 8. North-Holland, Amsterdam, 1-33.
9. Grötschel, M., O. Holland. 1985. Solving matching problems with linear programming. Math. Programming 23 243-259.
10. Labbé, M., F. V. Louveaux. 1997. Location problems. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, UK, 261-281.
11. _, D. Peeters, J.-F., Thisse. 1995. Location on networks. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing, Handbooks in Operations Research and Management Sciences, Volume 8. North-Holland, Amsterdam, 551-624.
12. Lapierre, S. D. 1995. The logistics of preventive health services using fixed and mobile facilities. Ph.D. Thesis. Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA.
13. Laporte, G. 1988. Location-routing problems. B. L. Golden, A. A. Assad, eds. Vehicle Routing: Methods and Studies. North-Holland, Amsterdam, 163-197.
14. _. 1997. Vehicle routing. M. Dell'Amico, F. Maffioli, S. Martello, eds. Annotated Bibliographies in Combinatorial Optimization. Wiley, Chichester, UK, 223-240.
15. Nemhauser, G. L., L. A. Wolsey. 1988. Integer and Combinatorial Optimization. Wiley, New York.
16. Padberg, M. W., M. R. Rao. 1982. Odd minimum cut-set and b-matching. Math. Oper. Res. 1 67-80.
17. Skorobohatyj, G. 1994. "Odd_mincut," computer code for determining odd minimum weight cut available at ftp://elib.zib-berlin.de/pub/Packages/mathprog/mincut/odd.