{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T19:37:53Z","timestamp":1766086673748},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2011,3,31]],"date-time":"2011-03-31T00:00:00Z","timestamp":1301529600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2013,8]]},"DOI":"10.1007\/s10479-011-0876-5","type":"journal-article","created":{"date-parts":[[2011,3,30]],"date-time":"2011-03-30T14:16:40Z","timestamp":1301494600000},"page":"217-235","source":"Crossref","is-referenced-by-count":34,"title":["The Robust Set Covering Problem with interval data"],"prefix":"10.1007","volume":"207","author":[{"given":"Jordi","family":"Pereira","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Igor","family":"Averbakh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,3,31]]},"reference":[{"key":"876_CR1","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/opre.45.2.226","volume":"45","author":"C. Aggarwal","year":"1997","unstructured":"Aggarwal, C., Orlin, J., & Tai, R. (1997). Optimized crossover for the independent set problem. Operations Research, 45, 226\u2013234.","journal-title":"Operations Research"},{"issue":"2","key":"876_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ejor.2008.09.012","volume":"197","author":"H. Aissi","year":"2009","unstructured":"Aissi, H., Bazgan, C., & Vanderpooten, D. (2009). Min-max and min-max regret versions of combinatorial optimization problems: a survey. European Journal of Operational Research, 197(2), 427\u2013438.","journal-title":"European Journal of Operational Research"},{"key":"876_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/PL00011424","volume":"90","author":"I. Averbakh","year":"2001","unstructured":"Averbakh, I. (2001). On the complexity of a class of combinatorial optimization problems with uncertainty. Mathematical Programming, 90, 263\u2013272.","journal-title":"Mathematical Programming"},{"key":"876_CR4","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/S0166-218X(03)00462-1","volume":"138","author":"I. Averbakh","year":"2004","unstructured":"Averbakh, I., & Lebedev, V. (2004). Interval data minmax regret network optimization problems. Discrete Applied Mathematics, 138, 289\u2013301.","journal-title":"Discrete Applied Mathematics"},{"key":"876_CR5","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1016\/j.omega.2005.01.013","volume":"34","author":"J. Bautista","year":"2006","unstructured":"Bautista, J., & Pereira, J. (2006). Modeling the problem of locating collection areas for urban waste management. An application to the metropolitan area of Barcelona. Omega, 34, 617\u2013629.","journal-title":"Omega"},{"key":"876_CR6","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. E. Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). OR-Library: distributing test problems by electronic mail. The Journal of the Operational Research Society, 41, 1069\u20131072.","journal-title":"The Journal of the Operational Research Society"},{"key":"876_CR7","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1016\/0377-2217(95)00159-X","volume":"94","author":"J. E. Beasley","year":"1996","unstructured":"Beasley, J. E., & Chu, P. C. (1996). A genetic algorithm for the set covering problem. European Journal of Operational Research, 94, 392\u2013404.","journal-title":"European Journal of Operational Research"},{"key":"876_CR8","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. F. Benders","year":"1962","unstructured":"Benders, J. F. (1962). Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik, 4, 238\u2013252.","journal-title":"Numerische Mathematik"},{"key":"876_CR9","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1023\/A:1018900128545","volume":"86","author":"M. J. Brusco","year":"1999","unstructured":"Brusco, M. J., Jacobs, L. W., & Thompson, G. M. (1999). A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated weighted set-covering problems. Annals of Operation Research, 86, 611\u2013627.","journal-title":"Annals of Operation Research"},{"key":"876_CR10","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A. Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., & Fischetti, M. (2000). Algorithms for the set covering problem. Annals of Operation Research, 98, 353\u2013371.","journal-title":"Annals of Operation Research"},{"key":"876_CR11","first-page":"415","volume-title":"Annotated bibliographies in combinatorial optimization","author":"S. Ceria","year":"1997","unstructured":"Ceria, S., Nobili, P., & Sassano, A. (1997). Set covering problem. In M. Dell\u2018Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 415\u2013428). New York: Wiley."},{"key":"876_CR12","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/j.ijpe.2003.11.014","volume":"95","author":"J. K. Cochran","year":"2005","unstructured":"Cochran, J. K., & Marquez\u00a0Uribe, A. (2005). A set covering formulation for agile capacity planning within supply chains. International Journal of Production Economics, 95, 139\u2013149.","journal-title":"International Journal of Production Economics"},{"key":"876_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0377-2217(03)00095-X","volume":"153","author":"A. T. Ernst","year":"2004","unstructured":"Ernst, A. T., Jiang, H., Krishnamoorthy, M., & Sier, D. (2004). Staff scheduling and rostering: a review of applications, methods and models. European Journal of Operational Research, 153, 3\u201327.","journal-title":"European Journal of Operational Research"},{"key":"876_CR14","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s10107-010-0365-7","volume":"124","author":"M. Fischetti","year":"2010","unstructured":"Fischetti, M., Salvagnin, D., & Zanette, A. (2010). A note on the selection of Benders\u2019 cuts. Mathematical Programming, 124, 175\u2013182.","journal-title":"Mathematical Programming"},{"key":"876_CR15","first-page":"63","volume-title":"New ideas in optimization","author":"L. M. Gambardella","year":"1999","unstructured":"Gambardella, L. M., Taillard, A. D., & Agazzi, G. (1999). MACS-VRPTW: a\u00a0multiple ant colony system for vehicle routing problems with time windows. In D. Corne, M. Dorigo, & F. Glover (Eds.), New ideas in optimization (pp.\u00a063\u201376). New York: McGraw-Hill."},{"key":"876_CR16","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A. M. Geoffrion","year":"1972","unstructured":"Geoffrion, A. M. (1972). Generalized Benders decomposition. Journal of Optimization Theory and Applications, 10, 237\u2013260.","journal-title":"Journal of Optimization Theory and Applications"},{"key":"876_CR17","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/0166-218X(92)00177-N","volume":"48","author":"M. Gothe-Lundgren","year":"1994","unstructured":"Gothe-Lundgren, M., & Larsson, T. (1994). A set covering reformulation of the pure fixed charge transportation problem. Discrete Applied Mathematics, 48, 245\u2013259.","journal-title":"Discrete Applied Mathematics"},{"key":"876_CR18","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1023\/B:ANOR.0000039516.50069.5b","volume":"131","author":"A. Jaszkiewicz","year":"2004","unstructured":"Jaszkiewicz, A. (2004). A comparative study of multiple-objective metaheuristics on the bi-objective set covering problem and the Pareto memetic algorithm. Annals of Operation Research, 131, 135\u2013158.","journal-title":"Annals of Operation Research"},{"key":"876_CR19","doi-asserted-by":"crossref","first-page":"620","DOI":"10.1016\/j.ejor.2007.07.035","volume":"199","author":"L. Jourdan","year":"2009","unstructured":"Jourdan, L., Basseur, M., & Talbi, E. G. (2009). Hybridizing exact methods and metaheuristics: a\u00a0taxonomy. European Journal of Operational Research, 199, 620\u2013629.","journal-title":"European Journal of Operational Research"},{"key":"876_CR20","series-title":"Studies in fuzziness and soft computing","volume-title":"Discrete optimization with interval data: minmax regret and fuzzy approach","author":"A. Kasperski","year":"2008","unstructured":"Kasperski, A. (2008). Discrete optimization with interval data: minmax regret and fuzzy approach. Studies in fuzziness and soft computing. Berlin: Springer."},{"key":"876_CR21","unstructured":"Kasperski, A., & Zielinski, P. (2004). Minimizing maximal regret in linear assignment problems with interval data (Raport serii PREPRINTY nr. 007). Instytut Matematyki PWr., Wroclaw."},{"key":"876_CR22","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ipl.2005.11.001","volume":"97","author":"A. Kasperski","year":"2005","unstructured":"Kasperski, A., & Zielinski, P. (2005). An approximation algorithm for interval data minmax regret combinatorial optimization problems. Information Processing Letters, 97, 177\u2013180.","journal-title":"Information Processing Letters"},{"key":"876_CR23","volume-title":"Robust discrete optimization and its applications","author":"P. Kouvelis","year":"2003","unstructured":"Kouvelis, P., & Yu, G. (2003). Robust discrete optimization and its applications. Dordrecht: Kluwer."},{"key":"876_CR24","doi-asserted-by":"crossref","first-page":"1387","DOI":"10.1016\/j.ejor.2005.09.028","volume":"176","author":"G. Lan","year":"2007","unstructured":"Lan, G., Dupuy, G. W., & Whitehouse, G. E. (2007). An effective and simple heuristic for the set covering problem. European Journal of Operational Research, 176, 1387\u20131403.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"876_CR25","doi-asserted-by":"crossref","first-page":"1479","DOI":"10.1016\/j.ejor.2005.02.060","volume":"174","author":"R. Montemanni","year":"2006","unstructured":"Montemanni, R. (2006). A Benders decomposition approach for the robust spanning tree problem with interval data. European Journal of Operational Research, 174(3), 1479\u20131490.","journal-title":"European Journal of Operational Research"},{"key":"876_CR26","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/s10288-005-0066-x","volume":"3","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., & Gambardella, L. M. (2005). The robust shortest path problem with interval data via Benders decomposition. 4OR, 3, 315\u2013328.","journal-title":"4OR"},{"key":"876_CR27","doi-asserted-by":"crossref","first-page":"366","DOI":"10.1287\/trsc.1060.0181","volume":"41","author":"R. Montemanni","year":"2007","unstructured":"Montemanni, R., Barta, J., Mastrolilli, M., & Gambardella, L. M. (2007). The robust Traveling Salesman Problem with interval data. Transportation Science, 41, 366\u2013381.","journal-title":"Transportation Science"},{"key":"876_CR28","first-page":"105","volume-title":"Handbook of metaheuristics","author":"P. Moscato","year":"2002","unstructured":"Moscato, P., & Cotta, C. (2002). A gentle introduction to Memetic Algorithms. In F. Glover & G. A. Kochenberger (Eds.), Handbook of metaheuristics (pp. 105\u2013144). Dordrecht: Kluwer."},{"key":"876_CR29","unstructured":"Pereira, J., & Averbakh, I. (2009). Exact and heuristic algorithms for the interval data robust assignment problem. Working paper, University of Toronto."},{"key":"876_CR30","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1016\/j.cie.2010.02.011","volume":"58","author":"Z. Ren","year":"2010","unstructured":"Ren, Z., Feng, Z., Ke, L., & Zhang, Z. (2010). New ideas for applying ant colony optimization to the set covering problem. Computers and Industrial Engineering, 58, 774\u2013784.","journal-title":"Computers and Industrial Engineering"},{"key":"876_CR31","doi-asserted-by":"crossref","first-page":"692","DOI":"10.1287\/mnsc.16.11.692","volume":"16","author":"C. Revelle","year":"1970","unstructured":"Revelle, C., Marks, D., & Liebman, J. S. (1970). An analysis of private and public sector location models. Management Science, 16, 692\u2013707.","journal-title":"Management Science"},{"key":"876_CR32","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1023\/A:1016540724870","volume":"8","author":"E.-G. Talbi","year":"2002","unstructured":"Talbi, E.-G. (2002). A taxonomy of hybrid metaheuristics. Journal of Heuristics, 8, 541\u2013564.","journal-title":"Journal of Heuristics"},{"key":"876_CR33","doi-asserted-by":"crossref","first-page":"350","DOI":"10.15807\/jorsj.50.350","volume":"50","author":"S. Umetani","year":"2007","unstructured":"Umetani, S., & Yagiura, M. (2007). Relaxation heuristics for the set covering problem. Journal of the Operations Research Society of Japan, 50, 350\u2013375.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"876_CR34","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)00301-7","volume":"92","author":"M. Yagiura","year":"1996","unstructured":"Yagiura, M., & Ibaraki, T. (1996). The use of dynamic programming in genetic algorithms for permutation problems. European Journal of Operational Research, 92, 387\u2013401.","journal-title":"European Journal of Operational Research"},{"key":"876_CR35","doi-asserted-by":"crossref","first-page":"472","DOI":"10.1016\/j.ejor.2004.10.018","volume":"172","author":"M. Yagiura","year":"2006","unstructured":"Yagiura, M., Kishida, M., & Ibaraki, T. (2006). A 3-flip neighborhood local search for the set covering problem. European Journal of Operational Research, 172, 472\u2013499.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0876-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-011-0876-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-011-0876-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,9]],"date-time":"2019-06-09T14:56:16Z","timestamp":1560092176000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-011-0876-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,3,31]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["876"],"URL":"https:\/\/doi.org\/10.1007\/s10479-011-0876-5","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3,31]]}}}