Location Theory Helps Solve a Double-Vision Problem

References

• Bhattacharya B., Shi Q., Dehne F., Sack J.-R., Zeh N. Optimal algorithms for the weighted p-center problems on the real line for small p. Proc. 10th Workshop Algorithms Data Structures (WADS 2007) (2007) 4619(Springer-Verlag, Berlin) 529–540Lecture Notes in Computer ScienceCrossref, Google Scholar
• Brandeau M. L., Sainfort F., Pierskalla W. P.Operations Research and Health Care: A Handbook of Methods and Applications (2004) (Springer-Verlag, Berlin) Google Scholar
• Daskin M. S.Network and Discrete Location: Models, Algorithms, and Applications (1995) (John Wiley & Sons, New York) Crossref, Google Scholar
• Drezner Z.Facility Location: A Survey of Applications and Methods (1995) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Drezner Z., Hamacher H. W.Facility Location: Theory and Algorithms (2002) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Ehrgott M., Güler C., Hamacher H. W., Shao L. Mathematical optimization in intensity modulated radiation therapy. 4OR (2008) 6(3):199–262Crossref, Google Scholar
• Francis R. L. An application of location theory in ophthalmology. (2006) Presentation, INFORMS Annual MeetingNovember 5(INFORMS, Hanover, MD) Google Scholar
• Francis R. L., McGinnis L. F., White J. A.Facility Layout and Location: An Analytical Approach (1992) 2nd ed.(Prentice-Hall, Englewood Cliffs, NJ) Google Scholar
• GOR Arbeitsgruppe (Society for Operations Research Working Group) HCM—Health Care Management. . Accessed July 1, 2009, http://www.gor-hcm.de/htdocs/index.htmlGoogle Scholar
• Hakimi S. L. Optimum locations of switching centers and the absolute centers and medians of a graph. Oper. Res. (1964) 12(3):450–459Link, Google Scholar
• Hakimi S. L. Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Oper. Res. (1965) 13(3):462–475Link, Google Scholar
• Handler G. Y. Finding two-centers of a tree: The continuous case. Transportation Sci. (1978) 12(2):93–106Link, Google Scholar
• Handler G. Y., Mirchandani P. B.Location on Networks: Theory and Algorithms (1979) (MIT Press, Cambridge, MA) Google Scholar
• Hassin R., Tamir A. Improved complexity bounds for location problems on the real line. Oper. Res. Lett. (1991) 10(7):395–402Crossref, Google Scholar
• INFORMS Health Applications Section. . Accessed July 1, 2009, http://ramanujan.math.trinity.edu/aholder/HealthApp/index.shtmlGoogle Scholar
• Kariv O., L Hakimi S. An algorithmic approach to network location problems. I: The p-centers. SIAM J. Appl. Math. (1979) 37(3):513–538Crossref, Google Scholar
• Kolen A., Tamir A., Mirchandani P. B., Francis R. L. Covering problems. Discrete Location Theory (1990) (Wiley-Interscience, New York) 263–304Google Scholar
• Kolesar P. Testing for vision loss in glaucoma suspects. Management Sci. (1980) 26(5):439–450Link, Google Scholar
• Lee E. K., Zaider M. Operations research advances cancer therapeutics. Interfaces (2008) 38(1):5–25Link, Google Scholar
• Love R., Morris J., Wesolowsky G.Facility Location: Models and Methods (1988) (North-Holland, Amsterdam) Google Scholar
• Mirchandani P. B., Francis R. L.Discrete Location Theory (1990) (Wiley-Interscience, New York) Google Scholar
• Nickel S., Puerto J.Location Theory: A Unified Approach (2005) (Springer-Verlag, Berlin) Google Scholar
• ORAHS The European Working Group on Operational Research Applied to Health Services. . Accessed July 1, 2009, http://www.management.soton.ac.uk/ORAHS/index.phpGoogle Scholar
• Prism diopterThe American Heritage Medical DictionaryAccessed September 14, 2009, http://medical-dictionary.thefreedictionary.com/prism+diopterGoogle Scholar
• Rabin S., Kolesar P. Mathematical optimization of glaucoma visual field screening protocols. Documenta Opthalmologica (1978) 45(2):361–380Crossref, Google Scholar
• Rabin S., Kolesar P., Podos S. M., Wilensky J. T. A visual field screening protocol for glaucoma. Amer. J. Opthalmology (1981) 92(4):630–635Google Scholar