On interval and circular-arc covering problems
Author
Abstract
Suggested Citation
DOI: 10.1007/s10479-018-3025-6
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
- CORNUEJOLS, Gérard & EMHAUSER, George L. & WOLSEY, Laurence A., 1980. "Worst-case and probabilistic analysis of algorithms for a location problem," LIDAM Reprints CORE 437, Université catholique de Louvain, Center for Operations Research and Econometrics (CORE).
- Gerard Cornuejols & George L. Nemhauser & Laurence A. Wolsey, 1980. "Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem," Operations Research, INFORMS, vol. 28(4), pages 847-858, August.
- de Werra, Dominique & Eisenbeis, Christine & Lelait, Sylvain & Stohr, Elena, 2002. "Circular-arc graph coloring: On chords and circuits in the meeting graph," European Journal of Operational Research, Elsevier, vol. 136(3), pages 483-500, February.
- Reuven Cohen & Mira Gonen & Asaf Levin & Shmuel Onn, 2017. "On nonlinear multi-covering problems," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 645-659, February.
- Alberto Caprara & Paolo Toth & Matteo Fischetti, 2000. "Algorithms for the Set Covering Problem," Annals of Operations Research, Springer, vol. 98(1), pages 353-371, December.
Citations
Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
Cited by:
- Songhua Li & Minming Li & Lingjie Duan & Victor C. S. Lee, 2022. "Online algorithms for the maximum k-interval coverage problem," Journal of Combinatorial Optimization, Springer, vol. 44(5), pages 3364-3404, December.
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.- 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.
- Reuven Cohen & Mira Gonen & Asaf Levin & Shmuel Onn, 2017. "On nonlinear multi-covering problems," Journal of Combinatorial Optimization, Springer, vol. 33(2), pages 645-659, February.
- R. Baldacci & E. Hadjiconstantinou & A. Mingozzi, 2004. "An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation," Operations Research, INFORMS, vol. 52(5), pages 723-738, October.
- Masoud Yaghini & Mohammad Karimi & Mohadeseh Rahbar, 2015. "A set covering approach for multi-depot train driver scheduling," Journal of Combinatorial Optimization, Springer, vol. 29(3), pages 636-654, April.
- Alireza Amirteimoori & Simin Masrouri, 2021. "DEA-based competition strategy in the presence of undesirable products: An application to paper mills," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 31(2), pages 5-21.
- Patrizia Beraldi & Andrzej Ruszczyński, 2002. "The Probabilistic Set-Covering Problem," Operations Research, INFORMS, vol. 50(6), pages 956-967, December.
- Jee Eun Kang & Will Recker, 2015. "Strategic Hydrogen Refueling Station Locations with Scheduling and Routing Considerations of Individual Vehicles," Transportation Science, INFORMS, vol. 49(4), pages 767-783, November.
- Otto, Alena & Tilk, Christian, 2024. "Intelligent design of sensor networks for data-driven sensor maintenance at railways," Omega, Elsevier, vol. 127(C).
- Jacob R. Fooks & Kent D. Messer & Maik Kecinski, 2018. "A Cautionary Note on the Use of Benefit Metrics for Cost-Effective Conservation," Environmental & Resource Economics, Springer;European Association of Environmental and Resource Economists, vol. 71(4), pages 985-999, December.
- Owais, Mahmoud & Moussa, Ghada S. & Hussain, Khaled F., 2019. "Sensor location model for O/D estimation: Multi-criteria meta-heuristics approach," Operations Research Perspectives, Elsevier, vol. 6(C).
- Nguyen, Tri-Dung, 2014. "A fast approximation algorithm for solving the complete set packing problem," European Journal of Operational Research, Elsevier, vol. 237(1), pages 62-70.
- Refael Hassin & Eitan Zemel, 1984. "On Shortest Paths in Graphs with Random Weights," Discussion Papers 593, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
- Scaparra, Maria P. & Church, Richard L., 2008. "An exact solution approach for the interdiction median problem with fortification," European Journal of Operational Research, Elsevier, vol. 189(1), pages 76-92, August.
- Dimitris Bertsimas & Dan A. Iancu & Dmitriy Katz, 2013. "A New Local Search Algorithm for Binary Optimization," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 208-221, May.
- Boschetti, Marco A. & Golfarelli, Matteo & Graziani, Simone, 2020. "An exact method for shrinking pivot tables," Omega, Elsevier, vol. 93(C).
- Billionnet, Alain, 2013. "Mathematical optimization ideas for biodiversity conservation," European Journal of Operational Research, Elsevier, vol. 231(3), pages 514-534.
- Naji-Azimi, Zahra & Toth, Paolo & Galli, Laura, 2010. "An electromagnetism metaheuristic for the unicost set covering problem," European Journal of Operational Research, Elsevier, vol. 205(2), pages 290-300, September.
- Marianov, Vladimir & Eiselt, H.A., 2024. "Fifty Years of Location Theory - A Selective Review," European Journal of Operational Research, Elsevier, vol. 318(3), pages 701-718.
- Sebastián Moreno & Jordi Pereira & Wilfredo Yushimito, 2020. "A hybrid K-means and integer programming method for commercial territory design: a case study in meat distribution," Annals of Operations Research, Springer, vol. 286(1), pages 87-117, March.
- Rongbing Huang & Seokjin Kim & Mozart Menezes, 2010. "Facility location for large-scale emergencies," Annals of Operations Research, Springer, vol. 181(1), pages 271-286, December.
More about this item
Keywords
Covering; Optimization; Dynamic programming;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:annopr:v:275:y:2019:i:2:d:10.1007_s10479-018-3025-6. 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.