{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,8]],"date-time":"2026-03-08T00:04:53Z","timestamp":1772928293187,"version":"3.50.1"},"reference-count":36,"publisher":"Elsevier BV","issue":"6","license":[{"start":{"date-parts":[[2004,5,1]],"date-time":"2004-05-01T00:00:00Z","timestamp":1083369600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers &amp; Operations Research"],"published-print":{"date-parts":[[2004,5]]},"DOI":"10.1016\/s0305-0548(03)00039-x","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T16:16:34Z","timestamp":1051114594000},"page":"863-876","source":"Crossref","is-referenced-by-count":132,"title":["A column generation approach to capacitated p-median problems"],"prefix":"10.1016","volume":"31","author":[{"given":"Luiz A.N.","family":"Lorena","sequence":"first","affiliation":[]},{"given":"Edson L.F.","family":"Senne","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00039-X_BIB1","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/opre.43.4.649","article-title":"A location based heuristic for general routing problems","volume":"43","author":"Bramel","year":"1995","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB2","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1002\/1520-6750(199106)38:3<447::AID-NAV3220380312>3.0.CO;2-0","article-title":"Optimal clustering","volume":"38","author":"Klein","year":"1991","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB3","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1016\/0377-2217(84)90155-3","article-title":"Solving capacitated clustering problems","volume":"18","author":"Mulvey","year":"1984","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0969-6016(94)90032-9","article-title":"Capacitated clustering problems by hybrid simulated annealing and tabu search","volume":"1","author":"Osman","year":"1994","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB5","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0191-2615(92)90032-R","article-title":"Clustering algorithms for consolidation of costumes orders into vehicle shipments","volume":"26","author":"Koskosidis","year":"1992","journal-title":"Transportation Research B"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB6","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0969-6016(99)00017-9","article-title":"An adaptive tabu search algorithm for the capacitated p-median problem","volume":"6","author":"Fran\u00e7a","year":"1999","journal-title":"International Transactions in Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB7","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1023\/A:1009665717611","article-title":"A bionomic approach to the capacitated p-median problem","volume":"4","author":"Maniezzo","year":"1998","journal-title":"Journal of Heuristics"},{"issue":"1","key":"10.1016\/S0305-0548(03)00039-X_BIB8","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1162\/106365601750406019","article-title":"Constructive genetic algorithm for clustering problems","volume":"9","author":"Lorena","year":"2001","journal-title":"Evolutionary Computation"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB9","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.2307\/2582903","article-title":"Or-library","volume":"41","author":"Beasley","year":"1990","journal-title":"Journal Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB10","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0377-2217(94)90401-4","article-title":"A surrogate heuristic for set covering problems","volume":"79","author":"Lorena","year":"1994","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB11","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/0377-2217(95)00041-0","article-title":"Relaxation heuristics for a generalized assignment problem","volume":"91","author":"Lorena","year":"1996","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB12","first-page":"133","article-title":"Improving traditional subgradient scheme for Lagrangean relaxation","volume":"1","author":"Lorena","year":"1999","journal-title":"International Journal of Mathematical Algorithms"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB13","unstructured":"Lorena LAN, Senne ELF. Local search heuristics for capacitated p-median problems. Networks and Spatial Economics 2002, to appear."},{"key":"10.1016\/S0305-0548(03)00039-X_BIB14","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0377-2217(98)00038-1","article-title":"Lagrangean\/surrogate relaxation for generalized assignment problems","volume":"114","author":"Narciso","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB15","series-title":"Computing tools for modeling, optimization and simulation: interfaces in computer science and operations research","first-page":"115","article-title":"Lagrangean\/surrogate heuristics for p-median problems","author":"Senne","year":"2000"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB16","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1287\/opre.11.3.331","article-title":"Location-allocation problems","volume":"11","author":"Cooper","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB17","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB18","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch-and-price","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB19","unstructured":"Carvalho JMV. Exact solution of bin-packing problems using column generation and branch-and-bound. Universidade do Minho, Departamento Produ\u00e7\u00e3o e Sistemas. Working Paper, 1996."},{"key":"10.1016\/S0305-0548(03)00039-X_BIB20","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/opre.45.5.649","article-title":"Flight attendant rostering for short-haul airline operations","volume":"45","author":"Day","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB21","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","article-title":"A column generation approach to the urban transit crew scheduling problem","volume":"23","author":"Desrochers","year":"1989","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB23","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB24","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"A linear programming approach to the cutting stock problem\u2014Part II","volume":"11","author":"Gilmore","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB25","unstructured":"Vance P. Crew scheduling, cutting stock and column generation: solving huge integer programs. PhD thesis, Georgia Institute of Technology, 1993."},{"key":"10.1016\/S0305-0548(03)00039-X_BIB26","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01300970","article-title":"Solving binary cutting stock problems by column generation and branch-and-bound","volume":"3","author":"Vance","year":"1994","journal-title":"Computational Optimization and Applications"},{"issue":"2","key":"10.1016\/S0305-0548(03)00039-X_BIB27","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1987210201051","article-title":"A class of combinatorial problems with polynomially solvable large scale set covering\/set partitioning relaxations","volume":"21","author":"Minoux","year":"1987","journal-title":"RAIRO"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB28","first-page":"703","article-title":"The cutting plane method for solving convex programs","volume":"8","author":"Kelley","year":"1960","journal-title":"Journal of the SIAM"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB29","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1023\/A:1018318117350","article-title":"On improvements to the analytic centre cutting plane method","volume":"11","author":"du Merle","year":"1998","journal-title":"Computational Optimization and Applications"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB30","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","article-title":"Stabilized column generation","volume":"194","author":"du Merle","year":"1999","journal-title":"Discrete Mathematics"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB31","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","article-title":"The Boxstep method for large-scale optimization","volume":"23","author":"Marsten","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB32","unstructured":"Neame PJ. Nonsmooth dual methods in integer programming. PhD thesis, Department of Mathematics and Statistics, The University of Melbourne, 1999."},{"key":"10.1016\/S0305-0548(03)00039-X_BIB33","series-title":"Knapsack problems: algorithms and computer implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB34","article-title":"The traveling salesman problem: computational solutions for TSP applications","volume":"vol. 840","author":"Reinelt","year":"1994"},{"key":"10.1016\/S0305-0548(03)00039-X_BIB35","unstructured":"ESRI Environmental Systems Research Institute, Inc. Avenue Customization and Application Development for ArcView, 1996."},{"key":"10.1016\/S0305-0548(03)00039-X_BIB36","unstructured":"ILOG CPLEX 6.5. ILOG Inc. Cplex Division, 1999."}],"container-title":["Computers &amp; Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480300039X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S030505480300039X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,22]],"date-time":"2019-03-22T00:27:04Z","timestamp":1553214424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S030505480300039X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,5]]},"references-count":36,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2004,5]]}},"alternative-id":["S030505480300039X"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00039-x","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,5]]}}}