A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems

Authors: Barbara Anthony Department of Mathematics and Computer Science, Southwestern University, Georgetown, Texas 78626
Vineet Goyal Operations Research Center, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139
Anupam Gupta Computer Science Department, Carnegie Mellon University, Pittsburgh, Pennsylvania 15213
Viswanath Nagarajan IBM T. J. Watson Research Center, Yorktown Heights, New York 10598
spacer 2010 Article
spacer   Bibliometrics
· Downloads (6 Weeks): n/a
· Downloads (12 Months): n/a
· Downloads (cumulative): n/a
· Citation Count: 0

Published in:
· Journal
Mathematics of Operations Research archive
Volume 35 Issue 1, February 2010
Pages 79-101
INFORMS Institute for Operations Research and the Management Sciences (INFORMS), Linthicum, Maryland, USA
table of contents doi>10.1287/moor.1090.0428

Tools and Resources

  • TOC Service: spacer

    • spacer Email
    • spacer RSS
  • Save to Binder
  • Export Formats:
    • BibTeX
    • EndNote
    • ACM Ref


Tags: approximation algorithms facility location robust optimization stochastic optimization
spacer Feedback | Switch to single page view (no tabs)

Powered by spacer

The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2014 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: spacer Adobe Reader    spacer QuickTime    spacer Windows Media Player    spacer Real Player
Did you know the ACM DL App is now available?
Did you know your Organization can subscribe to the ACM Digital Library?
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder
gipoco.com is neither affiliated with the authors of this page nor responsible for its contents. This is a safe-cache copy of the original web site.