{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T10:13:20Z","timestamp":1774260800463,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,6,5]],"date-time":"2006-06-05T00:00:00Z","timestamp":1149465600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Applic"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10589-006-6513-6","type":"journal-article","created":{"date-parts":[[2006,6,6]],"date-time":"2006-06-06T09:21:31Z","timestamp":1149585691000},"page":"239-260","source":"Crossref","is-referenced-by-count":63,"title":["Solving the p-Median Problem with a Semi-Lagrangian Relaxation"],"prefix":"10.1007","volume":"35","author":[{"given":"C.","family":"Beltran","sequence":"first","affiliation":[]},{"given":"C.","family":"Tadonki","sequence":"additional","affiliation":[]},{"given":"J. Ph.","family":"Vial","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,6,5]]},"reference":[{"key":"6513_CR1","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/PL00011405","volume":"89","author":"P. Avella","year":"2001","unstructured":"P. Avella and A. Sassano, \u201cOn the p-median polytope,\u201d Mathematical Programming, vol. 89, pp. 395\u2013411, 2001.","journal-title":"Mathematical Programming."},{"key":"6513_CR2","unstructured":"P. Avella, A. Sassano, and I. Vasil\u2019ev, \u201cComputational study of large-scale p-median problems,\u201d Technical Report, Dipartimento Di Informatica e Sistemistica, Universit\u00e0 di Roma \u201cLa Sapienza,\u201d 2003."},{"key":"6513_CR3","doi-asserted-by":"crossref","unstructured":"O. Briant and D. Naddef, \u201cThe optimal diversity management problem,\u201d Operations Research, vol. 52, no. 4, 2004.","DOI":"10.1287\/opre.1040.0108"},{"key":"6513_CR4","unstructured":"Christofides, Graph Theory: An Algorithmic Approach. Academic Press, New York, 1975."},{"key":"6513_CR5","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0167-6377(01)00062-1","volume":"28","author":"I.R.J. de Farias","year":"2001","unstructured":"I.R.J. de Farias, \u201cA family of facets for the uncapacitated p-median polytope,\u201d Operations Research Letters, vol. 28, pp. 161\u2013167, 2001.","journal-title":"Operations Research Letters."},{"key":"6513_CR6","unstructured":"O. du Merle and J.-P. Vial, \u201cProximal-ACCPM, a cutting plane method for column generation and lagrangian relaxation: Application to the p-median problem,\u201d Technical Report, Logilab, HEC, University of Geneva, 2002."},{"issue":"3","key":"6513_CR7","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1287\/opre.11.3.399","volume":"11","author":"H. Everett III","year":"1963","unstructured":"H. Everett III, \u201cGeneralized lagrange multiplier method for solving problems of optimum allocation of resources,\u201d Operations Research, vol. 11, no. 3, pp. 399\u2013471, 1963.","journal-title":"Operations Research."},{"key":"6513_CR8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BFb0120690","volume":"2","author":"A.M. Geoffrion","year":"1974","unstructured":"A.M. Geoffrion, \u201cLagrangean relaxation for integer programming,\u201d Mathematical Programming Study, vol. 2, pp. 82\u2013114, 1974.","journal-title":"Mathematical Programming Study."},{"key":"6513_CR9","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/mnsc.38.2.284","volume":"37","author":"J.L. Goffin","year":"1992","unstructured":"J.L. Goffin, A. Haurie, and J.P. Vial, \u201cDecomposition and nondifferentiable optimization with the projective algorithm,\u201d Management Science, vol. 37, pp. 284\u2013302, 1992.","journal-title":"Management Science."},{"key":"6513_CR10","unstructured":"J.-L. Goffin and J. Vial, \u201cConvex nondifferentiable optimization: A survey focussed on the analytic center cutting plane method,\u201d Technical Report 99.02, Geneva University\u2014HEC\u2014Logilab, 1999."},{"key":"6513_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF02592954","volume":"39","author":"M. Guignard","year":"1987","unstructured":"M. Guignard and S. Kim, \u201cLagrangean decomposition: A model yielding stronger Lagrangean bounds,\u201d Mathematical Programming, vol. 39, pp. 215\u2013228, 1987.","journal-title":"Mathematical Programming."},{"key":"6513_CR12","first-page":"191","volume":"79","author":"P. Hansen","year":"1997","unstructured":"P. Hansen and B. Jaumard, \u201cCluster analysis and mathematical programming,\u201d Mathematical Programming, vol. 79, pp. 191\u2013215, 1997.","journal-title":"Mathematical Programming."},{"key":"6513_CR13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P. Hansen","year":"2001","unstructured":"P. Hansen, N. Mladenovic, and D. Perez-Brito, \u201cVariable neighborhood decomposition search,\u201d Journal of Heuristics, vol. 7, pp. 335\u2013350, 2001.","journal-title":"Journal of Heuristics."},{"key":"6513_CR14","unstructured":"D.J. Higham and N.J. Higham, MATLAB Guide, SIAM, Philadelphia, Pennsilvania, USA, 2000."},{"key":"6513_CR15","unstructured":"J.B. Hiriart-Urruty and C. Lemar\u00e9chal, Convex Analysis and Minimization Algorithms, volume I and II. Springer-Verlag, Berlin, 1996."},{"key":"6513_CR16","doi-asserted-by":"crossref","unstructured":"E. Johnson, \u201cMathematical programming,\u201d Chapter cyclic groups, cutting planes and shortest path, Academic press, pp. 185\u2013211, 1973.","DOI":"10.1016\/B978-0-12-358350-5.50009-9"},{"issue":"3","key":"6513_CR17","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"O. Kariv and L. Hakimi, \u201cAn algorithmic approach to network location problems. ii: The p-medians,\u201d SIAM Journal of Applied Mathematics, vol. 37, no. 3, pp. 539\u2013560, 1979.","journal-title":"SIAM Journal of Applied Mathematics."},{"key":"6513_CR18","first-page":"703","volume":"8","author":"J.E. Kelley","year":"1960","unstructured":"J.E. Kelley, \u201cThe cutting-plane method for solving convex programs,\u201d Journal of the SIAM, vol. 8, pp. 703\u2013712, 1960.","journal-title":"Journal of the SIAM."},{"key":"6513_CR19","doi-asserted-by":"crossref","unstructured":"D. Klabjan, \u201cA new subadditive approach to integer programming,\u201d in W. Cook and A.S. Schulz, (eds.), Integer Programming and Combinatorial Optimization, 9th International IPCO Conference, Cambridge, MA, USA, May 27\u201329, 2002, Proceedings, volume 2337 of Lecture Notes in Computer Science. Springer, 2002.","DOI":"10.1007\/3-540-47867-1_27"},{"key":"6513_CR20","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1023\/B:COAP.0000044186.99585.51","volume":"29","author":"D. Klabjan","year":"2004","unstructured":"D. Klabjan, \u201cA practical algorithm for computing a subadditive dual function for set partitioning,\u201d Computational Optimization and Applications, vol. 29, pp. 347\u2013368, 2004.","journal-title":"Computational Optimization and Applications."},{"key":"6513_CR21","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/PL00011429","volume":"90","author":"C. Lemar\u00e9chal","year":"2001","unstructured":"C. Lemar\u00e9chal and A. Renaud, \u201cA geometric study of duality gaps, with applications,\u201d Mathematical Programming, Ser. A, vol. 90, pp. 399\u2013427, 2001.","journal-title":"Mathematical Programming, Ser. A."},{"key":"6513_CR22","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1287\/mnsc.25.4.329","volume":"25","author":"J.M. Mulvey","year":"1979","unstructured":"J.M. Mulvey and H.P. Crowder, \u201cCluster analysis: An application of lagrangian relaxation,\u201d Management Science, vol. 25, pp. 329\u2013340, 1979.","journal-title":"Management Science."},{"key":"6513_CR23","unstructured":"D.R. Musicant, \u201cMatlab\/cplex mex-files,\u201d 2000. http:\/\/www.cs.wisc.edu\/\u223cmusicant\/data\/cplex\/ ."},{"key":"6513_CR24","doi-asserted-by":"crossref","unstructured":"G.L. Nemhauser and L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley and Sons, 1988.","DOI":"10.1002\/9781118627372"},{"key":"6513_CR25","unstructured":"G. Reinelt, \u201cTsplib,\u201d 2001. http:\/\/www.iwr.uni-heidelberg.de\/groups\/comopt\/software\/TSPLIB95 ."},{"key":"6513_CR26","unstructured":"C. Tadonki, \u201cUsing cplex with matlab,\u201d 2003. http:\/\/www.omegacomputer.com\/staff\/tadonki\/using_cplex_with_matlab.htm ."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-6513-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-006-6513-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-006-6513-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:30Z","timestamp":1559288190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-006-6513-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,6,5]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["6513"],"URL":"https:\/\/doi.org\/10.1007\/s10589-006-6513-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,6,5]]}}}