{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T17:07:01Z","timestamp":1782234421622,"version":"3.54.5"},"reference-count":28,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2005,3,8]],"date-time":"2005-03-08T00:00:00Z","timestamp":1110240000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Networks"],"published-print":{"date-parts":[[2005,5]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The capacitated <jats:italic>p<\/jats:italic>\u2010median problem is the variation of the well\u2010known <jats:italic>p<\/jats:italic>\u2010median problem in which a demand is associated to each user, a capacity is associated to each candidate median, and the total demand of the users associated to the same median must not exceed its capacity. We present a branch\u2010and\u2010price algorithm, that exploits column generation, heuristics and branch\u2010and\u2010bound to compute optimal solutions. We compare our branch\u2010and\u2010price algorithm with other methods proposed so far, and we present computational results both on test instances taken from the literature and on random instances with different values of the ratio between the number of medians and the number of users. \u00a9 2004 Wiley Periodicals, Inc. NETWORKS, Vol. 45(3), 125\u2013142 2005<\/jats:p>","DOI":"10.1002\/net.20059","type":"journal-article","created":{"date-parts":[[2005,3,8]],"date-time":"2005-03-08T17:16:46Z","timestamp":1110302206000},"page":"125-142","source":"Crossref","is-referenced-by-count":63,"title":["A branch\u2010and\u2010price algorithm for the capacitated <i>p<\/i>\u2010median problem"],"prefix":"10.1002","volume":"45","author":[{"given":"Alberto","family":"Ceselli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Giovanni","family":"Righini","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"311","published-online":{"date-parts":[[2005,3,8]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(00)00072-1"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90040-2"},{"key":"e_1_2_1_4_2","unstructured":"A.Ceselli Algoritmi branch and bound e branch and price per il problema delle p\u2010mediane con capacit\u00e0(in Italian) Dipartimento di Technologie dell'Informazione Universit\u00e0 degli Studi di Milano Master degree thesis2002."},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(82)90160-6"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.23.8.789"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601353"},{"key":"e_1_2_1_8_2","article-title":"Hybrid scatter scatter search and path relinking for the capacitated p\u2010median problem","author":"Diaz J.A.","journal-title":"Eur J of Operat Res"},{"key":"e_1_2_1_9_2","unstructured":"J.J.Dongarra Performance of various computers using standard linear equations software University of Tennessee (available athttp:\/\/www.netlib.org\/benchmark\/performance.ps)2003."},{"key":"e_1_2_1_10_2","first-page":"5","article-title":"A dual\u2010bounded algorithm for the p\u2010median problem","volume":"28","author":"Galv\u00e3o R.D.","year":"1979","journal-title":"Operat Res"},{"key":"e_1_2_1_11_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.9.6.849"},{"key":"e_1_2_1_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(85)90012-8"},{"key":"e_1_2_1_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01580223"},{"key":"e_1_2_1_14_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(86)90328-0"},{"key":"e_1_2_1_15_2","doi-asserted-by":"publisher","DOI":"10.1137\/0137041"},{"key":"e_1_2_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_17_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0548(03)00039-X"},{"key":"e_1_2_1_18_2","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009665717611"},{"key":"e_1_2_1_19_2","first-page":"589","volume-title":"Operational Research '81","author":"Martello S.","year":"1981"},{"key":"e_1_2_1_20_2","volume-title":"Knapsack problems\u2014Algorithms and computer implementations","author":"Martello S.","year":"1989"},{"key":"e_1_2_1_21_2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90155-3"},{"key":"e_1_2_1_22_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.4.709"},{"key":"e_1_2_1_23_2","series-title":"Location on networks, in network routing","volume-title":"Handbooks in OR and MS","author":"Labb\u00e9 M.","year":"1995"},{"key":"e_1_2_1_24_2","doi-asserted-by":"publisher","DOI":"10.1002\/9781118627372"},{"key":"e_1_2_1_25_2","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":"13","author":"Osman I.H.","year":"1994","journal-title":"Int Trans Operat Res"},{"key":"e_1_2_1_26_2","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(87)90022-0"},{"key":"e_1_2_1_27_2","first-page":"758","article-title":"A minimal algorithm for the 0\u20131 knapsack problem","volume":"46","author":"Pisinger D.","year":"1995","journal-title":"Operat Res"},{"key":"e_1_2_1_28_2","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.24.3.345"},{"key":"e_1_2_1_29_2","doi-asserted-by":"publisher","DOI":"10.1287\/opre.45.6.831"}],"container-title":["Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fnet.20059","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/net.20059","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,18]],"date-time":"2023-10-18T01:20:53Z","timestamp":1697592053000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.20059"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,8]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["10.1002\/net.20059"],"URL":"https:\/\/doi.org\/10.1002\/net.20059","archive":["Portico"],"relation":{},"ISSN":["0028-3045","1097-0037"],"issn-type":[{"value":"0028-3045","type":"print"},{"value":"1097-0037","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,3,8]]}}}