The Uncapacitated Facility Location Problem with Client Matching

References

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