{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:53:00Z","timestamp":1769442780144,"version":"3.49.0"},"reference-count":24,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"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 & Operations Research"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0305-0548(00)00072-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:02:47Z","timestamp":1027605767000},"page":"365-386","source":"Crossref","is-referenced-by-count":51,"title":["A new method for solving capacitated location problems based on a set partitioning approach"],"prefix":"10.1016","volume":"29","author":[{"given":"Roberto","family":"Baldacci","sequence":"first","affiliation":[]},{"given":"Eleni","family":"Hadjiconstantinou","sequence":"additional","affiliation":[]},{"given":"Vittorio","family":"Maniezzo","sequence":"additional","affiliation":[]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(00)00072-1_BIB1","series-title":"Computers and intractability: a guide to the theory of NP completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/S0305-0548(00)00072-1_BIB2","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0305-0548(87)90022-0","article-title":"Efficient algorithms for the capacitated concentrator location problem","volume":"14","author":"Pirkul","year":"1987","journal-title":"Computers and Operations Research"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB3","series-title":"Discrete location theory","author":"Mirchandani","year":"1990"},{"issue":"11","key":"10.1016\/S0305-0548(00)00072-1_BIB4","doi-asserted-by":"crossref","first-page":"1107","DOI":"10.1057\/jors.1983.242","article-title":"An algorithm for the fixed charge assigning users to sources problem","volume":"34","author":"Neebe","year":"1983","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB5","unstructured":"Hansen P, Jaumard B, Sanlaville E. Weight constrained minimum sum-of-star clustering. Gerad Technical Report G-93-38, 1994."},{"key":"10.1016\/S0305-0548(00)00072-1_BIB6","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"},{"issue":"3","key":"10.1016\/S0305-0548(00)00072-1_BIB7","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(00)00072-1_BIB8","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 Heuristic"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB9","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/BF02614317","article-title":"Cluster analysis and mathematical programming","volume":"79","author":"Hansen","year":"1997","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB10","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1287\/mnsc.30.3.290","article-title":"An analysis of network location \u2013 problems with distance constraints","volume":"30","author":"Moon","year":"1984","journal-title":"Management Science"},{"issue":"3","key":"10.1016\/S0305-0548(00)00072-1_BIB11","first-page":"235","article-title":"The p-median problem with maximum distance constraints: a direct approach","volume":"1","author":"Choi","year":"1993","journal-title":"Location Science"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB12","doi-asserted-by":"crossref","first-page":"905","DOI":"10.1016\/0305-0548(94)00079-N","article-title":"Facility location on a tree with maximum distance constraints","volume":"22","author":"Moon","year":"1995","journal-title":"Computers and Operations Research"},{"issue":"10","key":"10.1016\/S0305-0548(00)00072-1_BIB13","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1108\/01443579510098338","article-title":"Facility location with and without maximum distance constraints through the p-median problem","volume":"15","author":"Chaudhry","year":"1995","journal-title":"International Journal of Operations and Production Management"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB14","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0377-2217(83)90179-0","article-title":"Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem","volume":"12","author":"Christofides","year":"1983","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB15","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01587093","article-title":"Valid inequalities and facets of the capacitated plant location problem","volume":"44","author":"Leung","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB16","unstructured":"Aardal K. Capacitated facility location: separation algorithms and computational experience. Technical Report, Department of Econometrics, Tilburg University, 1994."},{"key":"10.1016\/S0305-0548(00)00072-1_BIB17","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.34.1.145","article-title":"A cross decomposition algorithm for capacitated facility location","volume":"34","author":"Van Roy","year":"1985","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB18","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","article-title":"An algorithm for solving large capacitated warehouse location problems","volume":"33","author":"Beasley","year":"1988","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB19","unstructured":"CPLEX Optimization Inc. Using the CPLEX callable library and CPLEX mixed integer library, 1996."},{"key":"10.1016\/S0305-0548(00)00072-1_BIB20","unstructured":"Mingozzi A, Christofides N, Hadjiconstantinou E. An exact algorithm for the vehicle routing problem based on the set partitioning formulation. Internal Report Department of Mathematics, University of Bologna, Italy, 1994."},{"key":"10.1016\/S0305-0548(00)00072-1_BIB21","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/10556789408805563","article-title":"A set partitioning approach to the multiple depot vehicle scheduling problem","volume":"3","author":"Bianco","year":"1994","journal-title":"Optimization Methods and Software"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB22","first-page":"329","article-title":"An exact method for the vehicle routing problem with backhauls","volume":"33","author":"Mingozzi","year":"1998","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(00)00072-1_BIB23","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1002\/nav.3800330209","article-title":"Using simulated annealing to solve routing and location problem","volume":"33","author":"Golden","year":"1986","journal-title":"Naval Research Logistic Quarterly"},{"issue":"6","key":"10.1016\/S0305-0548(00)00072-1_BIB24","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1287\/opre.47.6.873","article-title":"A set partitioning approach to the crew scheduling problem","volume":"47","author":"Mingozzi","year":"1999","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000721?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054800000721?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:25:49Z","timestamp":1556479549000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054800000721"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0305054800000721"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(00)00072-1","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}