{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:27:35Z","timestamp":1769441255525,"version":"3.49.0"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,12,5]],"date-time":"2007-12-05T00:00:00Z","timestamp":1196812800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s10852-007-9074-5","type":"journal-article","created":{"date-parts":[[2007,12,6]],"date-time":"2007-12-06T16:16:15Z","timestamp":1196957775000},"page":"43-58","source":"Crossref","is-referenced-by-count":38,"title":["A Cut and Branch Approach for the Capacitated p-Median Problem Based on Fenchel Cutting Planes"],"prefix":"10.1007","volume":"7","author":[{"given":"Maurizio","family":"Boccia","sequence":"first","affiliation":[]},{"given":"Antonio","family":"Sforza","sequence":"additional","affiliation":[]},{"given":"Claudio","family":"Sterle","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Vasilyev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,12,5]]},"reference":[{"key":"9074_CR1","doi-asserted-by":"crossref","first-page":"91153","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"D. Applegate","year":"2003","unstructured":"Applegate, D., Bixby, R., Chvatal, V., Cook, W.: Implementing the Dantzig\u2013Fulkerson\u2013Johnson algorithm for large traveling salesman problems. Math. Program. 97, 91153 (2003)","journal-title":"Math. Program."},{"key":"9074_CR2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0548(00)00072-1","volume":"29","author":"R. Baldacci","year":"2002","unstructured":"Baldacci, R., Hadjiconstantinou, E., Maniezzo, V., Mingozzi, A.: A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29, 365\u2013386 (2002)","journal-title":"Comput. Oper. Res."},{"key":"9074_CR3","doi-asserted-by":"crossref","first-page":"734","DOI":"10.1137\/0803038","volume":"3","author":"E. Boyd","year":"1993","unstructured":"Boyd, E.: Generating Fenchel cutting planes for knapsack polyhedra. SIAM J. Optim. 3, 734\u2013750 (1993a)","journal-title":"SIAM J. Optim."},{"key":"9074_CR4","doi-asserted-by":"crossref","unstructured":"Boyd, E.: Solving integer programs with cutting planes and preprocessing. In: IPCO 1993, pp. 209\u2013220 (1993b)","DOI":"10.21236\/ADA453863"},{"key":"9074_CR5","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/opre.42.1.53","volume":"42","author":"E. Boyd","year":"1994","unstructured":"Boyd, E.: Fenchel cutting planes for integer programming. Oper. Res. 42, 53\u201364 (1994)","journal-title":"Oper. Res."},{"key":"9074_CR6","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1137\/0805021","volume":"5","author":"E. Boyd","year":"1995","unstructured":"Boyd, E.: On the convergence Fenchel cutting planes in mixed-integer programming. SIAM J. Optim. 5, 421\u2013435 (1995)","journal-title":"SIAM J. Optim."},{"key":"9074_CR7","first-page":"319","volume":"1","author":"A. Ceselli","year":"2003","unstructured":"Ceselli, A.: Two exact algorithms for the capacitated p-median problem. 4OR 1, 319\u2013340 (2003)","journal-title":"4OR"},{"issue":"3","key":"9074_CR8","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20059","volume":"45","author":"A. Ceselli","year":"2005","unstructured":"Ceselli, A., Righini, G.: A branch and price algorithm for the capacitated p-median problem. Networks 45(3), 125\u2013142 (2005)","journal-title":"Networks"},{"key":"9074_CR9","unstructured":"CPLEX: ILOG CPLEX 10.0 Reference manual. ILOG (2006)"},{"issue":"2","key":"9074_CR10","doi-asserted-by":"crossref","first-page":"570","DOI":"10.1016\/j.ejor.2004.08.016","volume":"169","author":"J. Diaz","year":"2006","unstructured":"Diaz, J., Fernandez, E.: Hybrid scater search and path relinking for the capacitated p-median problem. Eur. J. Oper. Res. 169(2), 570\u2013585 (2006)","journal-title":"Eur. J. Oper. Res."},{"key":"9074_CR11","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1023\/A:1027353520175","volume":"3","author":"L. Lorena","year":"2003","unstructured":"Lorena, L., Senne, E.: Local search heuristics for capacitated p-median problems. Netw. Spat. Econ. 3, 407\u2013419 (2003)","journal-title":"Netw. Spat. Econ."},{"issue":"6","key":"9074_CR12","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1016\/S0305-0548(03)00039-X","volume":"31","author":"L. Lorena","year":"2004","unstructured":"Lorena, L., Senne, E.: A column generation approach to capacitated p-median problems. Comput. Oper. Res. 31(6), 863\u2013876 (2004)","journal-title":"Comput. Oper. Res."},{"key":"9074_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1009665717611","volume":"4","author":"V. Maniezzo","year":"1998","unstructured":"Maniezzo, V., Mingozzi, A., Baldacci, R.: A Biotomic approach to the capacitated p-median problem. J Heuristics 4, 263\u2013280 (1998)","journal-title":"J Heuristics"},{"key":"9074_CR14","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)"},{"key":"9074_CR15","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10107-003-0433-3","volume":"99","author":"A. Neumaier","year":"2004","unstructured":"Neumaier, A., Shcherbina, O.: Safe bounds in linear and mixed-integer programming. Math. Program. A 99, 283\u2013296 (2004)","journal-title":"Math. Program. A"},{"key":"9074_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","volume":"13","author":"H. Pirkul","year":"1987","unstructured":"Pirkul, H.: Efficient algorithms for the capacitated concentrator location problem. Comput. Oper. Res. 13, 197\u2013208 (1987)","journal-title":"Comput. Oper. Res."},{"key":"9074_CR17","first-page":"758","volume":"46","author":"D. Pisinger","year":"1995","unstructured":"Pisinger, D.: A minimal algorithm for the 0\u20131 knapsack problem. Oper. Res. 46, 758\u2013767 (1995)","journal-title":"Oper. Res."},{"key":"9074_CR18","first-page":"1","volume":"0","author":"M. Ramos","year":"2004","unstructured":"Ramos, M., Saez, J.: Solving capacitated facility location problems by Fenchel cutting planes. J. Oper. Res. Soc. 0, 1\u201310 (2004)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"9074_CR19","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1287\/mnsc.24.3.345","volume":"24","author":"G. Ross","year":"1977","unstructured":"Ross, G., Soland, R.: Modeling facility location problems as generalized assignment problem. Manage. Sci. 24(3), 345\u2013357 (1977)","journal-title":"Manage. Sci."},{"issue":"6","key":"9074_CR20","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1287\/opre.45.6.831","volume":"45","author":"M. Savelsbergh","year":"1997","unstructured":"Savelsbergh, M.: A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6), 831\u2013841 (1997)","journal-title":"Oper. Res."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9074-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-007-9074-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-007-9074-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:30Z","timestamp":1559269590000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-007-9074-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12,5]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["9074"],"URL":"https:\/\/doi.org\/10.1007\/s10852-007-9074-5","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12,5]]}}}