References
- R. K. Ahuja and J. B. Orlin, "Inverse Optimization, Operations Research," Vol. 49, No. 5, pp. 771-783, October 2001. DOI: 10.1287/opre.49.5.771.10607
- C. Heuberger, “Inverse Combinatorial Optimization: A Survey on Problems, Methods, and Results,” Journal of Combinatorial Optimization, Vol. 8, No. 3, pp. 329-361, September 2004. DOI: 10.1023/B:JOCO.0000038914.26975.9b
-
J. Zhang and Z. Liu, “A General Model of Some Inverse Combinatorial Optimization Problems and its Solution Method under
$l{\infty}$ -norm,” Journal of Combinatorial Optimization, Vol. 6, No. 2, pp. 207-227, June 2002. DOI: 10.1023/A:1013807829021 - S. Xu and J. Zhang, “An Inverse Problem of the Weighted Shortest Path Problem,” Japan Journal of Industrial and Applied Mathematics, Vol. 12, No. 1, pp. 47-59, February 1995. DOI: 10.1007/BF03167381
- R.K. Ahuja and J.B. Orlin, “A Faster Algorithm for the Inverse Spanning Tree Problem,” Journal of Algorithms, Vol. 34, No. 1, pp. 177-193, January 2000. DOI: 10.1006/jagm.1999.1052
- Y. Chung, and M. Demange, "The 0-1 Inverse Maximum Stable Set Problem," Discrete Applied Mathematics, Vol. 156, No. 13, pp. 2501-2516, July 2008. DOI: 10.1016/j.dam.2008.03.015
- Y. Chung, J.F. Culus, and M. Demange, "Inverse Chromatic Number Problems in Interval and Permutation Graphs," European Journal of Operational Research Vol. 243, pp. 763-773, June 2015. DOI: 10.1016/j.ejor.2014.12.028
- Y. Chung, and M. Demange, "On Inverse Traveling Salesman Problems," 4OR - A Quarterly Journal of Operations Research, Vol. 10, pp. 193-209, June 2012. DOI: 10.1007/s10288-011-0194-4
- D. Bertsimas, V. Gupa and I.Ch. Paschlidis, "Inverse Optimization: A New Perspecive on the Black-Litterman Model," Operations Research, Vol. 60, No. 6, pp. 1389-1403, November-December 2012. DOI: 10.1287/opre.1120.1115
- A. Aswani, Z.-J. Shen, A. Siddiq, “Inverse Optimization with Noisy Data,” Operations Research, Vol. 66, No. 3, pp. 597-892, May-June 2018. DOI: 10.1287/opre.2017.1705
- T.C.Y. Chan, T. Lee, D. Terekhov, "Inverse optimization: Closed-form solutions, geometry, and goodness of fit," Management Science, Vol. 65, No. 3, pp. 955-1453, March 2019. DOI: 10.1287/mnsc.2017.2992
- P. M Esfahani, S. Shafieezadeh-Abadeh, G.A. Hanasusanto, D. Kuhn, “Data-driven inverse optimization with imperfect information,” Mathematical Programming, Vol. 167, No. 1, pp. 191-234, January 2018. DOI: 10.1007/s10107-017-1216-6
- K. Ghobadi, T. Lee, H. Mahmoudzadeh, D. Terekhov, “Robust inverse optimization,” Operations Research Letters, Vol. 46, No. 3, pp. 339-344, May 2018. DOI: 10.1016/j.orl.2018.03.007
- J. Zhang and X. Yang, “Partial Inverse Assignment Problem under L1-Norm,” Operations Research Letters, Vol. 35, No. 1, pp. 23-28, January 2007. DOI: 10.1016/j.orl.2005.12.003
- X.G. Yang, “Complexity of Partial Inverse Assignment Problem and Partial Inverse Cut Problem,” RAIRO Opereations Research, Vol. 35, No. 1, pp. 117-126, January March 2001. DOI: 10.1051/ro:2001106
- Lai T.C., Orlin J.B., "The Complexity of Preprocessing," Research Report of Sloan School of Management, MIT, November 2003.
- Y. Chung, and M. Park, "Partial Inverse Traveling Salesman Problem," accepted at Journal of the KORMS Society, October 2019.
- M.R. Garey, and D.S. Johnson, "Computers and Intractability - A Guide to The Theory of NP-completeness," San Francisco, Freeman, 1979.
- S. Angelov, B. Harb, S. Kannan, and L.S. Wang, "Weighted Isotonic Regression under the l1-Norm," In Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pp. 783-791, January 2006.
- N. Chakravarti, “Isotonic Median Regression: a Linear Programming Approach,” Mathematics of Operations Research, Vol. 14, No. 2, pp. 303-308, May 1989. DOI: 10.1287/moor.14.2.303
- T. Robertson and F. Wright, “Algorithms in Order Restricted Statistical Inference and the Cauchy Mean Value Property,” Annals of Statistics, Vol. 8, No. 3, pp. 645-651, May 1980. DOI: 10.1214/aos/1176345014