{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,13]],"date-time":"2024-07-13T14:02:09Z","timestamp":1720879329412},"reference-count":42,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T00:00:00Z","timestamp":1181606400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Int Trans Operational Res"],"published-print":{"date-parts":[[2007,7]]},"abstract":"Abstract<\/jats:title>This article presents a column generation algorithm to calculate new improved lower bounds to the solution of maximal covering location problems formulated as a p<\/jats:italic>\u2010median problem. This reformulation leads to instances that are difficult for column generation methods. The traditional column generation method is compared with the new approach, where the reduced cost criterion used at the column selection is modified by a Lagrangean\/surrogate multiplier. The efficiency of the new approach is tested with real data, where computational tests were conducted and showed the impact of sparsity and degeneracy on column generation\u2010based methods.<\/jats:p>","DOI":"10.1111\/j.1475-3995.2007.00593.x","type":"journal-article","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T10:18:10Z","timestamp":1181643490000},"page":"349-364","update-policy":"http:\/\/dx.doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":18,"title":["A column generation approach for the maximal covering location problem"],"prefix":"10.1111","volume":"14","author":[{"given":"Marcos Antonio","family":"Pereira","sequence":"first","affiliation":[]},{"given":"Luiz Antonio Nogueira","family":"Lorena","sequence":"additional","affiliation":[]},{"given":"Edson Luiz Fran\u00e7a","family":"Senne","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,6,12]]},"reference":[{"key":"e_1_2_8_2_1","unstructured":"Arakaki R.G.I. Lorena L.A.N. 2001.A constructive genetic algorithm for the maximal covering location problem. In: Proceedings of the 4th Metaheuristics International Conference (MIC'2001) 16\u201320 July Porto Portugal pp.13\u201317."},{"key":"e_1_2_8_3_1","volume-title":"Comparison of Bundle and Classical Column Generation","author":"Briant O.","year":"2005"},{"key":"e_1_2_8_4_1","doi-asserted-by":"publisher","DOI":"10.1111\/j.1435-5597.1974.tb00902.x"},{"key":"e_1_2_8_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.1.101"},{"key":"e_1_2_8_6_1","doi-asserted-by":"publisher","DOI":"10.1002\/9781118032343"},{"key":"e_1_2_8_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.5.649"},{"key":"e_1_2_8_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/b135457"},{"key":"e_1_2_8_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-25486-2_1"},{"key":"e_1_2_8_10_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.23.1.1"},{"key":"e_1_2_8_11_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.2.342"},{"key":"e_1_2_8_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-5355-6"},{"key":"e_1_2_8_13_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018318117350"},{"issue":"15","key":"e_1_2_8_14_1","first-page":"29","article-title":"Semi\u2010supervised support vector machines for unlabeled data classification","volume":"1","author":"Fung G.","year":"2000","journal-title":"Optimization Methods and Software"},{"key":"e_1_2_8_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00171-X"},{"key":"e_1_2_8_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.8.3.217"},{"key":"e_1_2_8_17_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"e_1_2_8_18_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.11.6.863"},{"key":"e_1_2_8_19_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.16.4.741"},{"key":"e_1_2_8_20_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.12.3.450"},{"key":"e_1_2_8_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02614317"},{"key":"e_1_2_8_22_1","doi-asserted-by":"publisher","DOI":"10.1068\/a160305"},{"key":"e_1_2_8_23_1","volume-title":"ILOG CPLEX 7.1. User's Manual","author":"ILOG Inc.","year":"2001"},{"issue":"1","key":"e_1_2_8_24_1","first-page":"57","article-title":"A Lagrangean\/surrogate heuristic for the maximal covering location problem using Hillsman's edition","volume":"9","author":"Lorena L.A.N.","year":"2002","journal-title":"International Journal of Industrial Engineering"},{"key":"e_1_2_8_25_1","volume-title":"Selected topics in column generation","author":"L\u00fcbbecke M.E.","year":"2002"},{"key":"e_1_2_8_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/0111030"},{"key":"e_1_2_8_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120702"},{"key":"e_1_2_8_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.23.3.389"},{"issue":"2","key":"e_1_2_8_29_1","first-page":"105","article-title":"A class of combinatorial problems with polynomially solvable large scale set covering\/partitioning relaxations","volume":"21","author":"Minoux M.","year":"1987","journal-title":"R.A.I.R.O. Recherche Op\u00e9rationnelle"},{"key":"e_1_2_8_30_1","unstructured":"Neame P.J. 1999. Nonsmooth dual methods in integer programming Ph.D. Thesis. University of Melbourne Melbourne."},{"key":"e_1_2_8_31_1","volume-title":"Discrete Optimization","author":"Parker R.G.","year":"1988"},{"key":"e_1_2_8_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1971.10482319"},{"key":"e_1_2_8_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(99)00336-7"},{"key":"e_1_2_8_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4567-5_6"},{"key":"e_1_2_8_35_1","unstructured":"Senne E.L.F. Lorena L.A.N. 2001.Stabilizing column generation using Lagrangean\/surrogate relaxation: an application top\u2010median location problems. In: European Operations Research Conference\u2013EURO XVIII 9\u201311 July Erasmus University Rotterdam the Netherlands. Available for download at:http:\/\/www.lac.inpe.br\/~lorena\/ejor\/EURO2001.pdf"},{"key":"e_1_2_8_36_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195900000280"},{"key":"e_1_2_8_37_1","unstructured":"Souza C.C. Moura A.V. Yunes T.H. 2000a.Solving very large crew scheduling problems to optimality. In: Proceedings of the 14th ACM Symposium on Applied Computing 19\u201321 March Como Italy pp.446\u2013451."},{"key":"e_1_2_8_38_1","doi-asserted-by":"crossref","unstructured":"Souza C.C. Moura A.V. Yunes T.H. 2000b.A hybrid approach for solving large scale crew scheduling problems. In:Goos G. Hartmanis J. Van Leeuwen J.(eds) Lecture Notes in Computer Sciences \u2013 Proceedings of the Second International Workshop on Practical Aspects of Declarative Languages (PADL'00) Boston USA 1753.Springer Verlag Berlin pp.293\u2013307.","DOI":"10.1007\/3-540-46584-7_20"},{"key":"e_1_2_8_39_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.21.2.189"},{"key":"e_1_2_8_40_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.19.6.1363"},{"key":"e_1_2_8_41_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018952112615"},{"key":"e_1_2_8_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01300970"},{"key":"e_1_2_8_43_1","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1969.10500990"}],"container-title":["International Transactions in Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1111%2Fj.1475-3995.2007.00593.x","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1111\/j.1475-3995.2007.00593.x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T23:15:09Z","timestamp":1696979709000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1111\/j.1475-3995.2007.00593.x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,12]]},"references-count":42,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,7]]}},"alternative-id":["10.1111\/j.1475-3995.2007.00593.x"],"URL":"https:\/\/doi.org\/10.1111\/j.1475-3995.2007.00593.x","archive":["Portico"],"relation":{},"ISSN":["0969-6016","1475-3995"],"issn-type":[{"value":"0969-6016","type":"print"},{"value":"1475-3995","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,12]]},"assertion":[{"value":"2007-06-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}