{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T10:52:56Z","timestamp":1774435976640,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T00:00:00Z","timestamp":1478908800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1007\/s10479-016-2360-8","type":"journal-article","created":{"date-parts":[[2016,11,12]],"date-time":"2016-11-12T02:56:15Z","timestamp":1478919375000},"page":"179-201","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A bi-objective approach to discrete cost-bottleneck location problems"],"prefix":"10.1007","volume":"267","author":[{"given":"Sune Lauth","family":"Gadegaard","sequence":"first","affiliation":[]},{"given":"Andreas","family":"Klose","sequence":"additional","affiliation":[]},{"given":"Lars Relund","family":"Nielsen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,11,12]]},"reference":[{"issue":"1","key":"2360_CR1","doi-asserted-by":"crossref","first-page":"42","DOI":"10.1016\/j.orl.2004.04.002","volume":"33","author":"T Achterberg","year":"2005","unstructured":"Achterberg, T., Koch, T., & Martin, A. (2005). Branching rules revisited. Operations Research Letters, 33(1), 42\u201354.","journal-title":"Operations Research Letters"},{"issue":"3","key":"2360_CR2","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1287\/mnsc.12.3.253","volume":"12","author":"M Balinski","year":"1965","unstructured":"Balinski, M. (1965). Integer programming: Methods, uses, computations. Management Science, 12(3), 253\u2013313.","journal-title":"Management Science"},{"issue":"1","key":"2360_CR3","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/j.ejor.2007.12.014","volume":"194","author":"J-F B\u00e9rub\u00e9","year":"2009","unstructured":"B\u00e9rub\u00e9, J.-F., Gendreau, M., & Potvin, J.-Y. (2009). An exact \n                        $$\\epsilon $$\n                        \n                            \n                                \u03f5\n                            \n                        \n                    -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits. European Journal of Operational Research, 194(1), 39\u201350.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2360_CR4","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1016\/0377-2217(86)90093-7","volume":"25","author":"L Chalmet","year":"1986","unstructured":"Chalmet, L., Lemonidis, L., & Elzinga, D. (1986). An algorithm for the bi-criterion integer programming problem. European Journal of Operational Research, 25(2), 292\u2013300.","journal-title":"European Journal of Operational Research"},{"key":"2360_CR5","volume-title":"Discrete Location Theory","author":"G Cornuejols","year":"1990","unstructured":"Cornuejols, G., Nemhauser, G., & Wolsey, L. A. (1990). The uncapacitated facility location problem. In P. Mirchandani & R. Francis (Eds.), Discrete Location Theory. New York: Wiley-Interscience."},{"issue":"3","key":"2360_CR6","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1016\/0377-2217(94)90275-5","volume":"76","author":"J Current","year":"1994","unstructured":"Current, J., & Weber, C. (1994). Application of facility location modeling constructs to vendor selection problems. European Journal of Operational Research, 76(3), 387\u2013392.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"2360_CR7","doi-asserted-by":"crossref","first-page":"1093","DOI":"10.1287\/mnsc.25.11.1093","volume":"25","author":"P Dearing","year":"1979","unstructured":"Dearing, P., & Newruck, F. (1979). A capacitated bottleneck facility location problem. Management Science, 25(11), 1093\u20131104.","journal-title":"Management Science"},{"key":"2360_CR8","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1057\/palgrave.jors.2601353","volume":"53","author":"J D\u00edaz","year":"2002","unstructured":"D\u00edaz, J., & Fern\u00e1ndez, E. (2002). A branch-and-price algorithm for the single source capacitated plant location problem. Journal of the Operational Research Society, 53, 728\u2013740.","journal-title":"Journal of the Operational Research Society"},{"key":"2360_CR9","volume-title":"Multicriteria Optimization","author":"M Ehrgott","year":"2005","unstructured":"Ehrgott, M. (2005). Multicriteria Optimization (2nd ed.). Berlin, Heidelberg: Springer.","edition":"2"},{"issue":"7","key":"2360_CR10","doi-asserted-by":"crossref","first-page":"1689","DOI":"10.1016\/j.apm.2009.10.005","volume":"34","author":"R Farahani","year":"2010","unstructured":"Farahani, R., SteadieSeifi, M., & Asgari, N. (2010). Multiple criteria facility location problems: A survey. Applied Mathematical Modelling, 34(7), 1689\u20131709.","journal-title":"Applied Mathematical Modelling"},{"issue":"3","key":"2360_CR11","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1016\/S0377-2217(02)00223-0","volume":"145","author":"E Fern\u00e1ndez","year":"2003","unstructured":"Fern\u00e1ndez, E., & Puerto, J. (2003). Multiobjective solution of the uncapacitated plant location problem. European Journal of Operational Research, 145(3), 509\u2013529.","journal-title":"European Journal of Operational Research"},{"issue":"10","key":"2360_CR12","doi-asserted-by":"crossref","first-page":"2418","DOI":"10.1016\/j.cor.2013.02.011","volume":"40","author":"C Filippi","year":"2013","unstructured":"Filippi, C., & Stevanato, E. (2013). Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits. Computers & Operations Research, 40(10), 2418\u20132428.","journal-title":"Computers & Operations Research"},{"key":"2360_CR13","unstructured":"Gadegaard, S., Klose, A., & Nielsen, L., (2016). A bi\u2013objective approach to discrete cost\u2013bottleneck location problems. \n                        https:\/\/github.com\/SuneGadegaard\/BOCBLP\n                        \n                    , commit: 384088cd374e7629c29dbe97b8d07f0a2c0dfbdb."},{"issue":"4","key":"2360_CR14","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1002\/nav.3800180404","volume":"18","author":"RS Garfinkel","year":"1971","unstructured":"Garfinkel, R. S., & Rao, M. (1971). The bottleneck transportation problems. Naval Research Logistics Quarterly, 18(4), 465\u2013472.","journal-title":"Naval Research Logistics Quarterly"},{"issue":"3","key":"2360_CR15","doi-asserted-by":"crossref","first-page":"462","DOI":"10.1287\/opre.13.3.462","volume":"13","author":"S Hakimi","year":"1965","unstructured":"Hakimi, S. (1965). Optimum distribution of switching centers in a communication network and some related graph theoretic problems. Operations Research, 13(3), 462\u2013475.","journal-title":"Operations Research"},{"issue":"3","key":"2360_CR16","doi-asserted-by":"crossref","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"SL Hakimi","year":"1964","unstructured":"Hakimi, S. L. (1964). Optimum locations of switching centers and the absolute centers and medians of a graph. Operations Research, 12(3), 450\u2013459.","journal-title":"Operations Research"},{"issue":"2","key":"2360_CR17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1111\/j.1467-9787.1976.tb00966.x","volume":"16","author":"J Halpern","year":"1976","unstructured":"Halpern, J. (1976). The location of a center-median convex combination on an undirected tree*. Journal of Regional Science, 16(2), 237\u2013245.","journal-title":"Journal of Regional Science"},{"issue":"5","key":"2360_CR18","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1287\/mnsc.24.5.535","volume":"24","author":"J Halpern","year":"1978","unstructured":"Halpern, J. (1978). Finding minimal center-median convex combination (cent-dian) of a graph. Management Science, 24(5), 535\u2013544.","journal-title":"Management Science"},{"issue":"2","key":"2360_CR19","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1002\/(SICI)1097-0037(199903)33:2<79::AID-NET1>3.0.CO;2-L","volume":"33","author":"H Hamacher","year":"1999","unstructured":"Hamacher, H., Labb\u00e9, M., & Nickel, S. (1999). Multicriteria network location problems with sum objectives. Networks, 33(2), 79\u201392.","journal-title":"Networks"},{"issue":"1","key":"2360_CR20","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/0377-2217(95)00186-7","volume":"94","author":"HW Hamacher","year":"1996","unstructured":"Hamacher, H. W., & Nickel, S. (1996). Multicriteria planar location problems. European Journal of Operational Research, 94(1), 66\u201386.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2360_CR21","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.orl.2006.03.019","volume":"35","author":"HW Hamacher","year":"2007","unstructured":"Hamacher, H. W., Pedersen, C. R., & Ruzika, S. (2007). Finding representative systems for discrete bicriterion optimization problems. Operations Research Letters, 35(3), 336\u2013344.","journal-title":"Operations Research Letters"},{"issue":"3","key":"2360_CR22","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1002\/nav.3800160307","volume":"16","author":"P Hammer","year":"1969","unstructured":"Hammer, P. (1969). Time minimizing transportation problems. Naval Research Logistics Quarterly, 16(3), 345\u2013357.","journal-title":"Naval Research Logistics Quarterly"},{"key":"2360_CR23","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/978-3-642-48782-8_9","volume-title":"Multiple Criteria Decision Making Theory and Application. Vol. 177 of Lecture Notes in Economics and Mathematical Systems","author":"P Hansen","year":"1980","unstructured":"Hansen, P. (1980). Bicriterion path problems. In G. Fandel & T. Gal (Eds.), Multiple Criteria Decision Making Theory and Application. Vol. 177 of Lecture Notes in Economics and Mathematical Systems (pp. 109\u2013127). Berlin Heidelberg: Springer."},{"issue":"3","key":"2360_CR24","doi-asserted-by":"crossref","first-page":"544","DOI":"10.1016\/S0377-2217(98)00008-3","volume":"113","author":"K Holmberg","year":"1999","unstructured":"Holmberg, K., R\u00f6nnqvist, M., & Yuan, D. (1999). An exact algorithm for the capacitated facility location problems with single sourcing. European Journal of Operational Research, 113(3), 544\u2013559.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"2360_CR25","doi-asserted-by":"crossref","first-page":"1109","DOI":"10.1016\/j.ejor.2005.03.078","volume":"179","author":"A Klose","year":"2007","unstructured":"Klose, A., & G\u00f6rtz, S. (2007). A branch-and-price algorithm for the capacitated facility location problem. European Journal of Operational Research, 179(3), 1109\u20131125.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2360_CR26","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/j.amc.2009.03.037","volume":"213","author":"G Mavrotas","year":"2009","unstructured":"Mavrotas, G. (2009). Effective implementation of the \n                        $$\\varepsilon $$\n                        \n                            \n                                \u03b5\n                            \n                        \n                    -constraint method in multi-objective mathematical programming problems. Applied Mathematics and Computation, 213(2), 455\u2013465.","journal-title":"Applied Mathematics and Computation"},{"key":"2360_CR27","first-page":"761","volume-title":"Mcdm location problems","author":"S Nickel","year":"2005","unstructured":"Nickel, S., Puerto, J., & Rodr\u00edguez-Ch\u00eda, A. (2005). Multiple Criteria Decision Analysis: State of the Art Surveys. International Series in Operations Research and Management Science. In J. Figueira, S. Greco, & M. Ehrgott (Eds.), Mcdm location problems (Vol. 19, pp. 761\u2013795). Berlin, Heidelberg: Springer."},{"issue":"10","key":"2360_CR28","first-page":"451","volume":"6","author":"P Pandian","year":"2011","unstructured":"Pandian, P., & Nataraja, G. (2011). A new method for solving bottleneck-cost transportation problems. International Mathematical Forum, 6(10), 451\u2013460.","journal-title":"International Mathematical Forum"},{"key":"2360_CR29","first-page":"27","volume":"11","author":"D P\u00e9rez-Brito","year":"1997","unstructured":"P\u00e9rez-Brito, D., Moreno-P\u00e9rez, J., & Rodr\u00edguez-Mart\u00edn, I. (1997). Finite dominating set for the p-facility cent-dian network location problem. Studies in Locational Analysis, 11, 27\u201340.","journal-title":"Studies in Locational Analysis"},{"key":"2360_CR30","first-page":"559","volume-title":"Progress in Combinatorial Optimization","author":"A Przybylski","year":"2011","unstructured":"Przybylski, A., Gandibleuz, X., & Ehrgott, M. (2011). The two phase method for multiobjective combinatorial optimization problems. In R. Mahjoub (Ed.), Progress in Combinatorial Optimization (pp. 559\u2013595). Hoboken: ISTE Ltd and John Wiley Sons Inc."},{"issue":"1","key":"2360_CR31","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s10479-006-0058-z","volume":"147","author":"T Ralphs","year":"2006","unstructured":"Ralphs, T., Saltzman, M., & Wiecek, M. (2006). An improved algorithm for solving biobjective integer programs. Annals of Operations Research, 147(1), 43\u201370.","journal-title":"Annals of Operations Research"},{"issue":"3","key":"2360_CR32","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1002\/net.20128","volume":"48","author":"J Reese","year":"2006","unstructured":"Reese, J. (2006). Solution methods for the p-median problem: An annotated bibliography. Networks, 48(3), 125\u2013142.","journal-title":"Networks"},{"issue":"3","key":"2360_CR33","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1016\/j.ejor.2006.12.044","volume":"184","author":"C Revelle","year":"2008","unstructured":"Revelle, C., Eiselt, H., & Daskin, M. (2008). A bibliography for some fundamental problem categories in discrete location science. European Journal of Operational Research, 184(3), 817\u2013848.","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"2360_CR34","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1016\/0377-2217(80)90142-3","volume":"4","author":"G Ross","year":"1980","unstructured":"Ross, G., & Soland, R. (1980). A multicriteria approach to the location of public facilities. European Journal of Operational Research, 4(5), 307\u2013321.","journal-title":"European Journal of Operational Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-016-2360-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2360-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-016-2360-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,7,5]],"date-time":"2018-07-05T07:45:42Z","timestamp":1530776742000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-016-2360-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,12]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2018,8]]}},"alternative-id":["2360"],"URL":"https:\/\/doi.org\/10.1007\/s10479-016-2360-8","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,12]]}}}