{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:40:16Z","timestamp":1752460816771},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540669166"},{"type":"electronic","value":"9783540466321"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-46632-0_29","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:45:01Z","timestamp":1195933501000},"page":"279-294","source":"Crossref","is-referenced-by-count":13,"title":["Reverse Center Location Problem"],"prefix":"10.1007","author":[{"given":"Jianzhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoguang","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mao-cheng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,3]]},"reference":[{"key":"29_CR1","unstructured":"Burton, D., Pulleyblank, W.R., Toint, Ph.L.: The inverse shortest paths with upper bounds on shortest path costs. Report 93\/03, (1993), Department of Mathematics, Facultes, Univeristaires ND de la Paix, B-5000 Nemur, Belgium"},{"key":"29_CR2","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D. Burton","year":"1992","unstructured":"Burton, D., Toint, Ph.L.: On an instance of the inverse shortest paths problem. Mathematical Programming 53 (1992) 45\u201361","journal-title":"Mathematical Programming"},{"key":"29_CR3","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF01193863","volume":"45","author":"M. Cai","year":"1997","unstructured":"Cai, M., Li, Y.: Inverse matroid intersection problem. ZOR Mathematical Methods of Operations Research 45 (1997) 235\u2013243","journal-title":"ZOR Mathematical Methods of Operations Research"},{"key":"29_CR4","unstructured":"Cai, M., Yang, X., Zhang, J.: The complexity analysis of the inverse center location problem. Journal of Global Optimization (to appear)"},{"key":"29_CR5","unstructured":"Christofides, N.: Graph Theory: An Algorithmic Approach. Academic Press Inc. (London) Ltd, (1975)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem proving procedures. Proc. 3rd ACM Symp. on the Theory of Computing, ACM(1971), 151\u2013158","DOI":"10.1145\/800157.805047"},{"key":"29_CR7","unstructured":"Fekete, S., Kromberg, S., Hochstattler, W., Moll, C.: The Complexity of an Inverse Shortest Paths Problem. Working paper (1993), University of Cologne."},{"key":"29_CR8","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide of the Theory of NP-Completeness. Freeman, San Francisco, (1979)"},{"key":"29_CR9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BF01582009","volume":"33","author":"M. Gr\u00f6tschel","year":"1985","unstructured":"Gr\u00f6tschel, M., J\u00fcnger, M., Reinelt, G.: On the acyclic subgraph polytope. Mathematical Programming 33 (1985) 28\u201342","journal-title":"Mathematical Programming"},{"volume-title":"Approximation Algorithms for NP-hard Problems","year":"1997","key":"29_CR10","unstructured":"Hochbaum, D.(eds.): Approximation Algorithms for NP-hard Problems. PWS, Boston, 1997"},{"key":"29_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0166-218X(97)86750-9","volume":"82","author":"Z. Hu","year":"1998","unstructured":"Hu, Z., Liu, Z.: A strongly polynomial algorithm for the inverse shortest arborescence problem. Discrete Applied Mathematics 82 (1998) 135\u2013154","journal-title":"Discrete Applied Mathematics"},{"key":"29_CR12","unstructured":"Lawler, E.L.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, (1976)"},{"key":"29_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0377-2217(92)90046-C","volume":"57","author":"L. Leung","year":"1992","unstructured":"Leung, L.: A graph-theoretic heuristic for designing loop-layout manufacturing systems. European Journal of Operational Research, 57 (1992) 243\u2013252","journal-title":"European Journal of Operational Research"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Orlin, J.B.: A faster strongly polynomial minimum cost flow algorithm. Proc. 20th ACM Symp. on the Theory of Comp., (1988), 377\u2013387","DOI":"10.21236\/ADA457044"},{"key":"29_CR15","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization: Algorithms and Complexity. Prentice-Hall Inc. Englewood Cliffs, New Jersey, (1982)"},{"key":"29_CR16","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF02579369","volume":"5","author":"\u00c9. Tardos","year":"1985","unstructured":"Tardos, \u00c9.: A strongly polynomial minimum cost circulation algorithm. Combinatorica 5 (1985) 247\u2013255","journal-title":"Combinatorica"},{"key":"29_CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1080\/02331939708844306","volume":"40","author":"C. Yang","year":"1997","unstructured":"Yang, C., Zhang, J.: Inverse maximum flow and minimum cut problems. Optimization 40 (1997) 147\u2013170","journal-title":"Optimization"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Yang, C., Zhang, J.: Inverse maximum capacity problem. Operations Research Spektrum (to appear)","DOI":"10.1007\/BF01539860"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Yang, C., Zhang, J.: Two general methods for inverse optimization problems. Applied Mathematics Letters (to appear)","DOI":"10.1016\/S0893-9659(98)00151-7"},{"key":"29_CR20","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01193836","volume":"48","author":"J. Zhang","year":"1998","unstructured":"Zhang, J., Cai, M.: Inverse problem of minimum cuts. ZOR Mathematical Methods of Operations Research 48 (1998) 51\u201358","journal-title":"ZOR Mathematical Methods of Operations Research"},{"key":"29_CR21","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","volume":"72","author":"J. Zhang","year":"1996","unstructured":"Zhang, J., Liu, Z.: Calculating some inverse linear programming problem. Journal of Computational and Applied Mathematics 72 (1996) 261\u2013273","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"29_CR22","first-page":"347","volume":"44","author":"J. Zhang","year":"1996","unstructured":"Zhang, J., Liu, Z., Ma, Z.: On inverse problem of minimum spanning tree with partition constraints. ZOR Mathematical Methods of Operations Research 44 (1996) 347\u2013358","journal-title":"ZOR Mathematical Methods of Operations Research"},{"key":"29_CR23","unstructured":"Zhang, J., Liu, Z., Ma, Z.: Inverse Fractional Matching Problem. The Journal of Australia Mathematics Society, Ser. B: Applied Mathematics (to appear)"},{"key":"29_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1080\/02331939608844197","volume":"37","author":"J. Zhang","year":"1996","unstructured":"Zhang, J., Ma, Z.: A network flow method for solving some inverse combinatorial optimization problems. Optimization 37 (1996) 59\u201372","journal-title":"Optimization"},{"key":"29_CR25","unstructured":"Zhang, J., Ma, Z.: Solution structure of some inverse optimization problems. Journal of Combinatorial Optimization (to appear)"},{"key":"29_CR26","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF01432364","volume":"41","author":"J. Zhang","year":"1995","unstructured":"Zhang, J., Ma, Z., Yang, C.: A column generation method for inverse shortest path problem. ZOR Mathematical Methods of Operations Research 41 (1995) 347\u2013358","journal-title":"ZOR Mathematical Methods of Operations Research"},{"key":"29_CR27","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1080\/10556789708805666","volume":"8","author":"J. Zhang","year":"1997","unstructured":"Zhang, J., Xu, S., Ma, Z.: An algorithm for inverse minimum spanning tree problem. Optimization Methods and Software 8 (1997) 69\u201384","journal-title":"Optimization Methods and Software"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46632-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,17]],"date-time":"2019-01-17T19:50:31Z","timestamp":1547754631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46632-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540669166","9783540466321"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-46632-0_29","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}