Mobile facility location: combinatorial filtering via weighted occupancy
Author
Abstract
Suggested Citation
DOI: 10.1007/s10878-012-9558-8
Download full text from publisher
As the access to this document is restricted, you may want to search for a different version of it.
References listed on IDEAS
- Serge A. Plotkin & David B. Shmoys & Éva Tardos, 1995. "Fast Approximation Algorithms for Fractional Packing and Covering Problems," Mathematics of Operations Research, INFORMS, vol. 20(2), pages 257-301, May.
- Éva Tardos, 1986. "A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs," Operations Research, INFORMS, vol. 34(2), pages 250-256, April.
- A.A. Ageev & M.I. Sviridenko, 2004. "Pipage Rounding: A New Method of Constructing Algorithms with Proven Performance Guarantee," Journal of Combinatorial Optimization, Springer, vol. 8(3), pages 307-328, September.
Most related items
These are the items that most often cite the same works as this one and are cited by the same works as this one.- Lisa Fleischer & Michel X. Goemans & Vahab S. Mirrokni & Maxim Sviridenko, 2011. "Tight Approximation Algorithms for Maximum Separable Assignment Problems," Mathematics of Operations Research, INFORMS, vol. 36(3), pages 416-431, August.
- Ting Pong & Hao Sun & Ningchuan Wang & Henry Wolkowicz, 2016. "Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem," Computational Optimization and Applications, Springer, vol. 63(2), pages 333-364, March.
- Barbara Anthony & Vineet Goyal & Anupam Gupta & Viswanath Nagarajan, 2010. "A Plant Location Guide for the Unsure: Approximation Algorithms for Min-Max Location Problems," Mathematics of Operations Research, INFORMS, vol. 35(1), pages 79-101, February.
- Evgeny Shchepin & Nodari Vakhania, 2006. "An absolute approximation algorithm for scheduling unrelated machines," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(6), pages 502-507, September.
- Jiaju Miao & Pawel Polak, 2023. "Online Ensemble of Models for Optimal Predictive Performance with Applications to Sector Rotation Strategy," Papers 2304.09947, arXiv.org.
- László A. Végh, 2017. "A Strongly Polynomial Algorithm for Generalized Flow Maximization," Mathematics of Operations Research, INFORMS, vol. 42(1), pages 179-211, January.
- Mao-Cheng Cai & Xiaoguang Yang & Yanjun Li, 1999. "Inverse Polymatroidal Flow Problem," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 115-126, July.
- Bin Liu & Miaomiao Hu, 2022. "Fast algorithms for maximizing monotone nonsubmodular functions," Journal of Combinatorial Optimization, Springer, vol. 43(5), pages 1655-1670, July.
- Cai Mao-Cheng, 1999. "Inverse Problems of Matroid Intersection," Journal of Combinatorial Optimization, Springer, vol. 3(4), pages 465-474, December.
- Klaus Jansen & Lorant Porkolab, 2001. "Improved Approximation Schemes for Scheduling Unrelated Parallel Machines," Mathematics of Operations Research, INFORMS, vol. 26(2), pages 324-338, May.
- Paul Gölz & Dominik Peters & Ariel Procaccia, 2022. "In This Apportionment Lottery, the House Always Wins," Post-Print hal-03834513, HAL.
- José R. Correa & Asaf Levin, 2009. "Monotone Covering Problems with an Additional Covering Constraint," Mathematics of Operations Research, INFORMS, vol. 34(1), pages 238-248, February.
- Freund, Yoav & Schapire, Robert E., 1999. "Adaptive Game Playing Using Multiplicative Weights," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 79-103, October.
- Simon Bruggmann & Rico Zenklusen, 2019. "Submodular Maximization Through the Lens of Linear Programming," Management Science, INFORMS, vol. 44(4), pages 1221-1244, November.
- Michael Holzhauser & Sven O. Krumke, 2018. "A generalized approximation framework for fractional network flow and packing problems," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 87(1), pages 19-50, February.
- Jason R. Marden & Adam Wierman, 2013. "Distributed Welfare Games," Operations Research, INFORMS, vol. 61(1), pages 155-168, February.
- Anupam Gupta & Marco Molinaro, 2016. "How the Experts Algorithm Can Help Solve LPs Online," Mathematics of Operations Research, INFORMS, vol. 41(4), pages 1404-1431, November.
- Dipti Dubey & S. K. Neogy, 2020. "On solving a non-convex quadratic programming problem involving resistance distances in graphs," Annals of Operations Research, Springer, vol. 287(2), pages 643-651, April.
- Cai Mao-Cheng & Yanjun Li, 1997. "Inverse Matroid Intersection Problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 45(2), pages 235-243, June.
- Vianney Perchet, 2015. "Exponential Weight Approachability, Applications to Calibration and Regret Minimization," Dynamic Games and Applications, Springer, vol. 5(1), pages 136-153, March.
More about this item
Keywords
Approximation algorithms; Movement problems; Non-metric facility location; Filtering; Occupancy problem;All these keywords.
Statistics
Access and download statisticsCorrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:jcomop:v:28:y:2014:i:2:d:10.1007_s10878-012-9558-8. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through the various RePEc services.