{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:36:40Z","timestamp":1725475000085},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540496946"},{"type":"electronic","value":"9783540496960"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11940128_54","type":"book-chapter","created":{"date-parts":[[2006,11,29]],"date-time":"2006-11-29T00:57:35Z","timestamp":1164761855000},"page":"537-546","source":"Crossref","is-referenced-by-count":2,"title":["Improved Algorithms for the Minmax-Regret 1-Center Problem"],"prefix":"10.1007","author":[{"given":"Tzu-Chin","family":"Lin","sequence":"first","affiliation":[]},{"given":"Hung-I","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Biing-Feng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"54_CR1","unstructured":"Alstrup, S., Lauridsen, P.W., Sommerlund, P., Thorup, M.: Finding cores of limited length. Technical Report. The IT University of Copenhagen (2001)"},{"key":"54_CR2","unstructured":"Averbakh, I.: On the complexity of a class of robust location problems. Working Paper. Western Washington University. Bellingham, WA (1997)"},{"key":"54_CR3","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0966-8349(98)00033-3","volume":"5","author":"I. Averbakh","year":"1997","unstructured":"Averbakh, I., Berman, O.: Minimax regret p-center location on a network with demand uncertainty. Location Science\u00a05, 247\u2013254 (1997)","journal-title":"Location Science"},{"key":"54_CR4","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/S0377-2217(99)00257-X","volume":"123","author":"I. Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Algorithms for the robust 1-center problem on a tree. European Journal of Operational Research\u00a0123, 292\u2013302 (2000)","journal-title":"European Journal of Operational Research"},{"key":"54_CR5","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1287\/ijoc.12.2.104.11897","volume":"12","author":"I. Averbakh","year":"2000","unstructured":"Averbakh, I., Berman, O.: Minmax regret median location on a network under uncertainty. Informs Journal on Computing\u00a012, 104\u2013110 (2000)","journal-title":"Informs Journal on Computing"},{"key":"54_CR6","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1002\/net.10062","volume":"41","author":"I. Averbakh","year":"2003","unstructured":"Averbakh, I., Berman, O.: An improved algorithm for the minmax regret median problem on a tree. Networks\u00a041, 97\u2013103 (2003)","journal-title":"Networks"},{"key":"54_CR7","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1023\/A:1020711416254","volume":"110","author":"R.E. Burkard","year":"2002","unstructured":"Burkard, R.E., Dollani, H.: A note on the robust 1-center problem on trees. Annals of Operations Research\u00a0110, 69\u201382 (2002)","journal-title":"Annals of Operations Research"},{"key":"54_CR8","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1002\/(SICI)1097-0037(199803)31:2<93::AID-NET4>3.0.CO;2-E","volume":"31","author":"B.T. Chen","year":"1998","unstructured":"Chen, B.T., Lin, C.S.: Minmax-regret robust 1-median location on a tree. Networks\u00a031, 93\u2013103 (1998)","journal-title":"Networks"},{"key":"54_CR9","first-page":"209","volume":"33","author":"Z. Drezner","year":"1980","unstructured":"Drezner, Z.: Sensitivity analysis of the optimal location of a facility. Naval Research Logistics Quarterly\u00a033, 209\u2013224 (1980)","journal-title":"Naval Research Logistics Quarterly"},{"key":"54_CR10","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"A.J. Goldman","year":"1971","unstructured":"Goldman, A.J.: Optimal center location in simple networks. Transportation Science\u00a05, 212\u2013221 (1971)","journal-title":"Transportation Science"},{"key":"54_CR11","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1287\/opre.12.3.450","volume":"12","author":"S.L. Hakimi","year":"1964","unstructured":"Hakimi, S.L.: Optimal locations of switching centers and the absolute centers and medians of a graph. Operations Research\u00a012, 450\u2013459 (1964)","journal-title":"Operations Research"},{"key":"54_CR12","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. I: The p-centers. SIAM Journal on Applied Mathematics\u00a037, 513\u2013538 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"54_CR13","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1137\/0137041","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.L.: An algorithmic approach to network location problems. II: The p-medians. SIAM Journal on Applied Mathematics\u00a037, 539\u2013560 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"54_CR14","unstructured":"Kouvelis, P., Vairaktarakis, G., Yu, G.: Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Working Paper 93\/94-3-4. Department of Management Science and Information Systems, Graduate School of Business, The University of Texas at Austin (1994)"},{"key":"54_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2620-6","volume-title":"Robust discrete optimization and its applications","author":"P. Kouvelis","year":"1997","unstructured":"Kouvelis, P., Yu, G.: Robust discrete optimization and its applications. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"54_CR16","doi-asserted-by":"crossref","unstructured":"Ku, S.C., Lu, C.J., Wang, B.F., Lin, T.C.: Efficient algorithms for two generalized 2-median problems on trees. In: Proceedings of the 12th International Symposium on Algorithms and Computation, pp. 768\u2013778 (2001)","DOI":"10.1007\/3-540-45678-3_65"},{"key":"54_CR17","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/opre.39.6.961","volume":"38","author":"M. Labbe","year":"1991","unstructured":"Labbe, M., Thisse, J.-F., Wendell, R.: Sensitivity analysis in minisum facility location problems. Operations Research\u00a038, 961\u2013969 (1991)","journal-title":"Operations Research"},{"key":"54_CR18","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear-programming in R\n                           3 and related problems. SIAM Journal on Computing\u00a012, 759\u2013776 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"54_CR19","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1287\/trsc.13.2.85","volume":"13","author":"P.B. Mirchandani","year":"1979","unstructured":"Mirchandani, P.B., Odoni, A.R.: Location of medians on stochastic networks. Transportation Science\u00a013, 85\u201397 (1979)","journal-title":"Transportation Science"},{"key":"54_CR20","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0377-2217(85)90096-7","volume":"21","author":"P.B. Mirchandani","year":"1985","unstructured":"Mirchandani, P.B., Oudjit, A., Wong, R.T.: Multidimensional extensions and a nested dual approach for the M-median problem. European Journal of Operational Research\u00a021, 121\u2013137 (1985)","journal-title":"European Journal of Operational Research"},{"key":"54_CR21","unstructured":"Oudjit, A.: Median locations on deterministic and probabilistic multidimensional networks. PhD Dissertation. Rennselaer Polytechnic Institute, Troy (1981)"},{"key":"54_CR22","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1287\/trsc.17.2.168","volume":"17","author":"J.R. Weaver","year":"1983","unstructured":"Weaver, J.R., Church, R.L.: Computational procedures of location problems on stochastic networks. Transportation Science\u00a017, 168\u2013180 (1983)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11940128_54.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:50:03Z","timestamp":1619495403000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11940128_54"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540496946","9783540496960"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11940128_54","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}