{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T16:45:21Z","timestamp":1768927521585,"version":"3.49.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T00:00:00Z","timestamp":1187136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,7]]},"DOI":"10.1007\/s10878-007-9098-9","type":"journal-article","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T08:12:55Z","timestamp":1187079175000},"page":"50-67","source":"Crossref","is-referenced-by-count":43,"title":["The inverse 1-maxian problem with edge length modification"],"prefix":"10.1007","volume":"16","author":[{"given":"Elisabeth","family":"Gassner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,15]]},"reference":[{"key":"9098_CR1","volume-title":"Network flows: theory, algorithms, and applications","author":"RK Ahuja","year":"1993","unstructured":"Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice Hall, New Jersey"},{"key":"9098_CR2","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0166-218X(85)90006-X","volume":"10","author":"WW Bein","year":"1985","unstructured":"Bein WW, Brucker P, Tamir A (1985) Minimum cost flow algorithms for series-parallel networks. Discret Appl Math 10:117\u2013124","journal-title":"Discret Appl Math"},{"key":"9098_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02060467","volume":"40","author":"O Berman","year":"1992","unstructured":"Berman O, Ingco DI, Odoni A (1992) Improving the location of minisum facilities through network modification. Ann Oper Res 40:1\u201316","journal-title":"Ann Oper Res"},{"key":"9098_CR4","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/net.3230240105","volume":"24","author":"O Berman","year":"1994","unstructured":"Berman O, Ingco DI, Odoni A (1994) Improving the location of minimax facilities through network modification. Networks 24:31\u201341","journal-title":"Networks"},{"key":"9098_CR5","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1006\/jagm.1993.1048","volume":"15","author":"H Booth","year":"1993","unstructured":"Booth H, Tarjan RE (1993) Finding the minimum-cost maximum flow in a series-parallel network. J Algorithms 15:416\u2013446","journal-title":"J Algorithms"},{"key":"9098_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.disopt.2004.03.003","volume":"1","author":"RE Burkard","year":"2004","unstructured":"Burkard RE, Pleschiutschnig C, Zhang J (2004) Inverse median problems. Discret Optim 1:23\u201339","journal-title":"Discret Optim"},{"key":"9098_CR7","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1002\/net.20115","volume":"48","author":"RE Burkard","year":"2006","unstructured":"Burkard RE, Gassner E, Hatzl J (2006) A linear time algorithm for the reverse 1-median problem on a cycle. Networks 48:16\u201323","journal-title":"Networks"},{"key":"9098_CR8","doi-asserted-by":"crossref","unstructured":"Burkard RE, Gassner E, Hatzl J (2007) Reverse 2-median problem on trees, accpeted for publication in Discret Appl Math","DOI":"10.1016\/j.dam.2007.04.005"},{"key":"9098_CR9","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"9098_CR10","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1287\/trsc.5.2.212","volume":"5","author":"AJ Goldman","year":"1971","unstructured":"Goldman AJ (1971) Optimum center location in simple networks. Transp Sci 5:212\u2013221","journal-title":"Transp Sci"},{"key":"9098_CR11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1997.1493","volume":"55","author":"MR Henzinger","year":"1997","unstructured":"Henzinger MR, Klein PN, Rao S, Subramanian S (1997) Faster shortest-path algorithms for planar graphs. J Comput Syst Sci 55:3\u201323","journal-title":"J Comput Syst Sci"},{"key":"9098_CR12","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger C (2004) Inverse combinatorial optimization: a survey on problems, methods, and results. J Comb Optim 8:329\u2013361","journal-title":"J Comb Optim"},{"key":"9098_CR13","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0196-6774(86)90023-4","volume":"7","author":"N Robertson","year":"1986","unstructured":"Robertson N, Seymour PD (1986) Graph minors II. Algorithmic aspects of tree-width. J Algorithms 7:309\u2013322","journal-title":"J Algorithms"},{"key":"9098_CR14","doi-asserted-by":"crossref","first-page":"550","DOI":"10.1137\/0404048","volume":"4","author":"A Tamir","year":"1991","unstructured":"Tamir A (1991) Obnoxious facility location on graphs. SIAM J Discret Math 4:550\u2013567","journal-title":"SIAM J Discret Math"},{"key":"9098_CR15","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1287\/trsc.18.1.76","volume":"18","author":"SS Ting","year":"1984","unstructured":"Ting SS (1984) A linear-time algorithm for maxisum facility location on tree networks. Transp Sci 18:76\u201384","journal-title":"Transp Sci"},{"key":"9098_CR16","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/3-540-46632-0_29","volume":"1741","author":"JZ Zhang","year":"1999","unstructured":"Zhang JZ, Yang XG, Cai MC (1999) Reverse center location problem. Lect Notes Comput Sci 1741:279\u2013294","journal-title":"Lect Notes Comput Sci"},{"key":"9098_CR17","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1016\/S0377-2217(99)00122-8","volume":"124","author":"J Zhang","year":"2000","unstructured":"Zhang J, Liu Z, Ma Z (2000) Some reverse location problems. Eur J Oper Res 124:77\u201388","journal-title":"Eur J Oper Res"},{"key":"9098_CR18","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0377-2217(02)00876-7","volume":"155","author":"JZ Zhang","year":"2004","unstructured":"Zhang JZ, Yang XG, Cai MC (2004) Inapproximability and a polynomially solvable special case of a network improvement problem. Eur J Oper Res 155:251\u2013257","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9098-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9098-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9098-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:12Z","timestamp":1559276292000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9098-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,15]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,7]]}},"alternative-id":["9098"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9098-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,15]]}}}