{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,25]],"date-time":"2025-07-25T10:00:31Z","timestamp":1753437631630},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,1,8]],"date-time":"2012-01-08T00:00:00Z","timestamp":1325980800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s10288-011-0194-4","type":"journal-article","created":{"date-parts":[[2012,1,6]],"date-time":"2012-01-06T23:26:38Z","timestamp":1325892398000},"page":"193-209","source":"Crossref","is-referenced-by-count":7,"title":["On inverse traveling salesman problems"],"prefix":"10.1007","volume":"10","author":[{"given":"Yerim","family":"Chung","sequence":"first","affiliation":[]},{"given":"Marc","family":"Demange","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,1,8]]},"reference":[{"issue":"1","key":"194_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1006\/jagm.1999.1052","volume":"34","author":"R Ahuja","year":"2000","unstructured":"Ahuja R, Orlin J (2000) A faster algorithm for the inverse spanning tree problem. J Algorithms 34(1): 177\u2013193","journal-title":"J Algorithms"},{"issue":"5","key":"194_CR2","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"R Ahuja","year":"2001","unstructured":"Ahuja R, Orlin J (2001) Inverse optimization. Oper Res 49(5): 771\u2013783","journal-title":"Oper Res"},{"key":"194_CR3","doi-asserted-by":"crossref","unstructured":"Angelov S, Harb B, Kannan S, Wang LS (2006) Weighted isotonic regression under the l1 norm. In: Proceedings of the 17th annual ACM-SIAM symposium on discrete algorithms, SODA, pp 783\u2013791","DOI":"10.1145\/1109557.1109643"},{"key":"194_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and approximation: Combinatorial optimization problems and their approximability properties","author":"G Ausiello","year":"1999","unstructured":"Ausiello G, Crescenzi P, Gambosi G, Kann V, Marchetti-Spaccame-La A, Protasi M (1999) Complexity and approximation: Combinatorial optimization problems and their approximability properties. Springer, Berlin"},{"key":"194_CR5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton D, Toint P (1992) On an instance of the inverse shortest paths problem. Math Programm 53: 45\u201361","journal-title":"Math Programm"},{"key":"194_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF01582056","volume":"63","author":"D Burton","year":"1994","unstructured":"Burton D, Toint P (1994) On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math Programm 63: 1\u201322","journal-title":"Math Programm"},{"key":"194_CR7","unstructured":"Carr SC, Lovejoy WS (1997) The inverse newsvendor problem: choosing an optimal demand portfolio for capacitated resources. Technical report, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI"},{"issue":"2","key":"194_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1287\/moor.14.2.303","volume":"14","author":"N Chakravarti","year":"1989","unstructured":"Chakravarti N (1989) Isotonic median regression; a linear programming approach. Math Oper Res 14(2): 303\u2013308","journal-title":"Math Oper Res"},{"key":"194_CR9","unstructured":"Chung Y, Culus JF, Demange M (2008) Inverse booking problems. In: Proceedings of the 2d workshop on algorithms and computation, WALCOM 2008, Lecture Notes in Computer Science, vol 4921, pp 180\u2013187"},{"issue":"13","key":"194_CR10","doi-asserted-by":"crossref","first-page":"2501","DOI":"10.1016\/j.dam.2008.03.015","volume":"156","author":"Y Chung","year":"2008","unstructured":"Chung Y, Demange M (2008) The 0-1 inverse maximum stable set problem. Discret Appl Math 156(13): 2501\u20132516","journal-title":"Discret Appl Math"},{"issue":"1-2","key":"194_CR11","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF02831968","volume":"23","author":"E Ciura","year":"2007","unstructured":"Ciura E, Deaconu A (2007) Inverse minimum flow problem. J Appl Math Comput 23(1-2): 193\u2013203","journal-title":"J Appl Math Comput"},{"issue":"1","key":"194_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ejor.2007.09.018","volume":"192","author":"M Demange","year":"2009","unstructured":"Demange M, Ekim T, de Werra D (2009) A tutorial on the use of graph coloring for some problems in robotics. Eur J Oper Res 192(1): 41\u201355","journal-title":"Eur J Oper Res"},{"key":"194_CR13","unstructured":"Demange M, Monnot J (2010) An introduction to inverse combinatorial problems. In: Paradigms of combinatorial optimization (problems and new approaches). ISTE-WILEY, London-Hoboken (UK-USA), Vangelis Th., Paschos, pp 547\u2013586"},{"key":"194_CR14","unstructured":"Dembo R, Merkoulovitch L, Rosen D (1998) Images from a portfolio. Algorithmics research working paper, Algorithmics, Inc., Canada"},{"key":"194_CR15","unstructured":"Dial B (1997) Minimum-revenue congestion pricing, Part 1: a fast algorithm for the single-origin case. Technical report, The Volpe National Transportation Systems Center, Kendall Square, Cambridge, MA"},{"issue":"1","key":"194_CR16","doi-asserted-by":"crossref","first-page":"439","DOI":"10.4007\/annals.2005.162.439","volume":"162","author":"I Dinur","year":"2005","unstructured":"Dinur I, Safra S (2005) On the hardness of approximating minimum vertex cover. Ann Math 162(1): 439\u2013485","journal-title":"Ann Math"},{"key":"194_CR17","volume-title":"Computers and intractability\u2014a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability\u2014a guide to the theory of NP-completeness. Freeman, San Francisco"},{"issue":"3","key":"194_CR18","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(3): 329\u2013361","journal-title":"J Comb Optim"},{"key":"194_CR19","doi-asserted-by":"crossref","unstructured":"Karakostas G (2005) A better approximation ratio for the vertex cover problem. In: Proceedings of the 32nd international colloquium on automata, languages and programming, ICALP, Lecture Notes in Computer Science, vol 3580, pp 1043\u20131050","DOI":"10.1007\/11523468_84"},{"issue":"1","key":"194_CR20","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/S0097539795286612","volume":"28","author":"S Khanna","year":"1998","unstructured":"Khanna S, Motwani R, Sudan M, Vazirani V (1998) On syntactic versus computational views of approximability. SIAM J Comput 28(1): 164\u2013191","journal-title":"SIAM J Comput"},{"key":"194_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-3899-1","volume-title":"Seismic tomography","author":"G Nolet","year":"1987","unstructured":"Nolet G (1987) Seismic tomography. Reidel, Dordrecht"},{"key":"194_CR22","volume-title":"Computational complexity","author":"C Papadimitriou","year":"1994","unstructured":"Papadimitriou C (1994) Computational complexity. Addison-Wesley, New York"},{"key":"194_CR23","unstructured":"Papadimitriou CH, Steiglitz K (1976) Some complexity results for the traveling salesman problem. In: STOC\u201976, pp 1\u20139"},{"key":"194_CR24","doi-asserted-by":"crossref","first-page":"645","DOI":"10.1214\/aos\/1176345014","volume":"8","author":"T Robertson","year":"1980","unstructured":"Robertson T, Wright F (1980) Algorithms in order restricted statistical inference and the cauchy mean value property. Ann Stat 8: 645\u2013651","journal-title":"Ann Stat"},{"key":"194_CR25","volume-title":"Inverse problem theory: methods for data fitting and model parameter estimation","author":"A Tarantola","year":"1987","unstructured":"Tarantola A (1987) Inverse problem theory: methods for data fitting and model parameter estimation. Elsevier, Amsterdam"},{"issue":"1","key":"194_CR26","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","volume":"12","author":"S Xu","year":"1995","unstructured":"Xu S, Zhang J (1995) An inverse problem of the weighted shortest path problem. Jpn J Ind Appl Math 12(1): 47\u201359","journal-title":"Jpn J Ind Appl Math"},{"key":"194_CR27","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/BF01594937","volume":"50","author":"Y Ye","year":"1991","unstructured":"Ye Y (1991) An O(n 3 L) potential reduction algorithm for linear programming. Math Programm 50: 239\u2013258","journal-title":"Math Programm"},{"issue":"2","key":"194_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1023\/A:1013807829021","volume":"6","author":"J Zhang","year":"2002","unstructured":"Zhang J, Liu Z (2002) A general model of some inverse combinatorial optimization problems and its solution method under l-norm. J Comb Optim 6(2): 207\u2013227","journal-title":"J Comb Optim"},{"issue":"2","key":"194_CR29","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1023\/A:1008360312607","volume":"15","author":"J Zhang","year":"1999","unstructured":"Zhang J, Yang X, Cai M (1999) The complexity analysis of the inverse center location problem. J Glob Optim 15(2): 213\u2013218","journal-title":"J Glob Optim"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0194-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-011-0194-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-011-0194-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,22]],"date-time":"2019-06-22T01:57:13Z","timestamp":1561168633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-011-0194-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1,8]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["194"],"URL":"https:\/\/doi.org\/10.1007\/s10288-011-0194-4","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1,8]]}}}