{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T07:09:36Z","timestamp":1771484976167,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"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":[[2005,12]]},"DOI":"10.1007\/s10589-005-4800-2","type":"journal-article","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T17:03:45Z","timestamp":1127840625000},"page":"215-230","source":"Crossref","is-referenced-by-count":11,"title":["A Branch-and-Cut Algorithm for the Median-Path Problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Pasquale","family":"Avella","sequence":"first","affiliation":[]},{"given":"Maurizio","family":"Boccia","sequence":"additional","affiliation":[]},{"given":"Antonio","family":"Sforza","sequence":"additional","affiliation":[]},{"given":"Igor","family":"Vasil'Ev","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"4800_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":"4800_CR2","unstructured":"P. Avella, A. Sassano, and I. Vasil'ev, \u201cComputational study of large-scale $p$-Median problems,\u201d Technical Report 08-03, DIS \u2013 University of Rome \u201cLa Sapienza,\u201d 2003."},{"key":"4800_CR3","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1023\/A:1018990331754","volume":"86","author":"P. Avella","year":"1999","unstructured":"P. Avella and A. Sforza, \u201cLogical reduction tests for the p-Median problem,\u201d Annals of Operations Research, vol. 86, pp. 105\u2013115, 1999.","journal-title":"Annals of Operations Research"},{"key":"4800_CR4","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/BF01581274","volume":"58","author":"E. Balas","year":"1993","unstructured":"E. Balas and M. Fischetti, \u201cA lifting procedure for the asymmetric traveling salesman polytope and a large new class of facets,\u201d Mathematical Programming, vol. 58, pp. 325\u2013352, 1993.","journal-title":"Mathematical Programming"},{"issue":"1","key":"4800_CR5","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1002\/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2","volume":"36","author":"E. Balas","year":"2001","unstructured":"E. Balas and M. Oosten, \u201cOn the Cycle polytope of a directed graph,\u201d Networks, vol. 36, no. 1, pp. 34\u201346, 2001.","journal-title":"Networks"},{"key":"4800_CR6","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1016\/S0377-2217(97)00187-2","volume":"104","author":"G. Bruno","year":"1998","unstructured":"G. Bruno, G. Ghiani, and G. Improta, \u201cA multi-modal approach to the location of a rapid transit line,\u201d European Journal of Operational Research, vol. 104, pp. 321\u2013332, 1998.","journal-title":"European Journal of Operational Research"},{"key":"4800_CR7","unstructured":"F. Buckley and F. Harary, Distance in Graphs, Addison-Wesley, 1990."},{"key":"4800_CR8","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1287\/trsc.21.3.188","volume":"21","author":"J.R. Current","year":"1989","unstructured":"J.R. Current, C.S. Revelle, and C.S. Cohon, \u201cThe Median Shortest Path Problem: A multiobjective approach to analyze cost vs. accessibility in the design of transportation networks,\u201d Transportation Science, vol. 21, pp. 188\u2013197, 1989.","journal-title":"Transportation Science"},{"key":"4800_CR9","doi-asserted-by":"crossref","unstructured":"R.W. Floyd, \u201cAlgorithm 97: Shortest path,\u201d Comm. ACM, vol. 5, 1962.","DOI":"10.1145\/367766.368168"},{"key":"4800_CR10","unstructured":"M. Grotschel and M.W. Padberg, \u201cPolyhedral theory,\u201d in The Traveling Salesman Problem, Lenstra, Lawrel and Shmoys, Rinnooy Kan (Eds.), Wiley & Sons, 1985."},{"key":"4800_CR11","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1002\/net.3230230605","volume":"23","author":"S.L. Hakimi","year":"1993","unstructured":"S.L. Hakimi, E.F. Schmeichel, and M. Labb\u00e9, \u201cOn locating path- or tree-shaped facilities on networks,\u201d Networks, vol. 23, pp. 543\u2013555, 1993.","journal-title":"Networks"},{"key":"4800_CR12","doi-asserted-by":"crossref","unstructured":"M. Labb\u00e9, G. Laporte, and I. Rodriguez Martin, \u201cPath, tree cycle location,\u201d in Fleet Management and Logistics, T.G. Crainic and G. Laporte (Eds.), Kluwer, 1998.","DOI":"10.1007\/978-1-4615-5755-5_9"},{"key":"4800_CR13","unstructured":"M. Labb\u00e9, G. Laporte, I. Rodriguez Martin, and J.J. Salazar, \u201cThe median cycle problem,\u201d Technical Report ULB-SMG-01, 2001."},{"key":"4800_CR14","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.3230150304","volume":"15","author":"E. Minieka","year":"1985","unstructured":"E. Minieka, \u201cThe optimal location of a path or tree in a tree network,\u201d Networks, vol. 15, pp. 309\u2013321, 1985.","journal-title":"Networks"},{"key":"4800_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0196-6774(83)90015-9","volume":"4","author":"E. Minieka","year":"1983","unstructured":"E. Minieka and N.H. Patel, \u201cOn finding the core of a tree with a specified length,\u201d Journal of Algorithms, vol. 4, pp. 345\u2013352, 1983.","journal-title":"Journal of Algorithms"},{"key":"4800_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1016\/0196-6774(80)90012-7","volume":"1","author":"C.A. Morgan","year":"1980","unstructured":"C.A. Morgan and P.J. Slater, \u201cA linear algorithm for a core of a tree,\u201d Journal of Algorithms, vol. 1, pp. 247\u2013258, 1980.","journal-title":"Journal of Algorithms"},{"key":"4800_CR17","doi-asserted-by":"crossref","first-page":"833","DOI":"10.1287\/opre.23.4.833","volume":"23","author":"M.W. Padberg","year":"1975","unstructured":"M.W. Padberg, \u201cA note on zero-one programming,\u201d Operations Research, vol. 23, pp. 833\u2013837, 1975.","journal-title":"Operations Research"},{"key":"4800_CR18","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01581260","volume":"58","author":"M. Queyranne","year":"1993","unstructured":"M. Queyranne and Y. Wang, \u201cHamiltonian path and symmetric traveling salesman polytopes,\u201d Mathematical Programming, vol. 58, pp. 89\u2013110, 1993.","journal-title":"Mathematical Programming"},{"key":"4800_CR19","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1002\/net.3230200404","volume":"20","author":"M.B. Richey","year":"1990","unstructured":"M.B. Richey, \u201cOptimal location of a path or tree on a network with cycles,\u201d Networks, vol. 20, pp. 391\u2013407, 1990.","journal-title":"Networks"},{"key":"4800_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.16.1.1","volume":"16","author":"P.J. Slater","year":"1982","unstructured":"P.J. Slater, \u201cLocating central paths in a graph,\u201d Transportation Science, vol. 16, pp. 1\u201318, 1982.","journal-title":"Transportation Science"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4800-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-005-4800-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-005-4800-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,9]],"date-time":"2020-04-09T23:24:47Z","timestamp":1586474687000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-005-4800-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4800"],"URL":"https:\/\/doi.org\/10.1007\/s10589-005-4800-2","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}