{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,4]],"date-time":"2026-08-04T10:56:27Z","timestamp":1785840987102,"version":"3.56.0"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T00:00:00Z","timestamp":1616457600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1007\/s11590-021-01721-4","type":"journal-article","created":{"date-parts":[[2021,3,23]],"date-time":"2021-03-23T02:02:36Z","timestamp":1616464956000},"page":"1061-1079","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Inverse integer optimization with multiple observations"],"prefix":"10.1007","volume":"15","author":[{"given":"Mahsa","family":"Moghaddass","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1585-9806","authenticated-orcid":false,"given":"Daria","family":"Terekhov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,3,23]]},"reference":[{"issue":"5","key":"1721_CR1","doi-asserted-by":"publisher","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","volume":"49","author":"RK Ahuja","year":"2001","unstructured":"Ahuja, R.K., Orlin, J.B.: Inverse optimization. Oper. Res. 49(5), 771\u2013783 (2001)","journal-title":"Oper. Res."},{"issue":"2","key":"1721_CR2","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.orl.2008.12.001","volume":"37","author":"L Wang","year":"2009","unstructured":"Wang, L.: Cutting plane algorithms for the inverse mixed integer linear programming problem. Oper. Res. Lett. 37(2), 114\u2013116 (2009)","journal-title":"Oper. Res. Lett."},{"issue":"4","key":"1721_CR3","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s11590-009-0131-z","volume":"3","author":"AJ Schaefer","year":"2009","unstructured":"Schaefer, A.J.: Inverse integer programming. Optim. Lett. 3(4), 483\u2013489 (2009)","journal-title":"Optim. Lett."},{"issue":"3","key":"1721_CR4","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1016\/j.orl.2020.02.007","volume":"48","author":"A Ghate","year":"2020","unstructured":"Ghate, A.: Inverse optimization in semi-infinite linear programs. Oper. Res. Lett. 48(3), 278\u2013285 (2020)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1721_CR5","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1287\/mnsc.1050.0445","volume":"52","author":"MD Troutt","year":"2006","unstructured":"Troutt, M.D., Pang, W.-K., Hou, S.-H.: Behavioral estimation of mathematical programming objective function coefficients. Manag. Sci. 52(3), 422\u2013434 (2006)","journal-title":"Manag. Sci."},{"issue":"1","key":"1721_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/s10107-017-1216-6","volume":"167","author":"PM Esfahani","year":"2018","unstructured":"Esfahani, P.M., Shafieezadeh-Abadeh, S., Hanasusanto, G.A., Kuhn, D.: Data-driven inverse optimization with imperfect information. Math. Program. 167(1), 191\u2013234 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"1721_CR7","doi-asserted-by":"publisher","first-page":"870","DOI":"10.1287\/opre.2017.1705","volume":"66","author":"A Aswani","year":"2018","unstructured":"Aswani, A., Shen, Z.-J., Siddiq, A.: Inverse optimization with noisy data. Oper. Res. 66(3), 870\u2013892 (2018)","journal-title":"Oper. Res."},{"issue":"1","key":"1721_CR8","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/j.orl.2017.12.004","volume":"46","author":"O Tavasl\u0131o\u011flu","year":"2018","unstructured":"Tavasl\u0131o\u011flu, O., Lee, T., Valeva, S., Schaefer, A.J.: On the structure of the inverse-feasible region of a linear program. Oper. Res. Lett. 46(1), 147\u2013152 (2018)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1721_CR9","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1287\/mnsc.2017.2992","volume":"65","author":"TCY Chan","year":"2019","unstructured":"Chan, T.C.Y., Lee, T., Terekhov, D.: Inverse optimization: closed-form solutions, geometry, and goodness of fit. Manag. Sci. 65(3), 1115\u20131135 (2019)","journal-title":"Manag. Sci."},{"issue":"1","key":"1721_CR10","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Math. Program. 53(1), 45\u201361 (1992a)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"1721_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01582056","volume":"63","author":"D Burton","year":"1994","unstructured":"Burton, D., Toint, P.L.: On the use of an inverse shortest paths algorithm for recovering linearly correlated costs. Math. Program. 63(1\u20133), 1\u201322 (1994)","journal-title":"Math. Program."},{"key":"1721_CR12","unstructured":"Dong, C., Zeng, B.: Inferring parameters through inverse multiobjective optimization (2018). arXiv preprintarXiv:1808.00935"},{"key":"1721_CR13","doi-asserted-by":"crossref","unstructured":"Tan, Y., Delong, A., Terekhov, D.: Deep inverse optimization. In: International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 540\u2013556. Springer (2019)","DOI":"10.1007\/978-3-030-19212-9_36"},{"issue":"1","key":"1721_CR14","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/s10444-016-9477-9","volume":"43","author":"C Gerhards","year":"2017","unstructured":"Gerhards, C., Pereverzyev, S., Tkachenko, P.: A parameter choice strategy for the inversion of multiple observations. Adv. Comput. Math. 43(1), 101\u2013112 (2017)","journal-title":"Adv. Comput. Math."},{"issue":"1\u20133","key":"1721_CR15","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF01585693","volume":"53","author":"D Burton","year":"1992","unstructured":"Burton, D., Toint, P.L.: On an instance of the inverse shortest paths problem. Math. Program. 53(1\u20133), 45\u201361 (1992b)","journal-title":"Math. Program."},{"issue":"1","key":"1721_CR16","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1287\/mnsc.41.1.76","volume":"41","author":"MD Troutt","year":"1995","unstructured":"Troutt, M.D.: A maximum decisional efficiency estimation principle. Manag. Sci. 41(1), 76\u201382 (1995)","journal-title":"Manag. Sci."},{"issue":"3","key":"1721_CR17","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1016\/j.orl.2018.03.007","volume":"46","author":"K Ghobadi","year":"2018","unstructured":"Ghobadi, K., Lee, T., Mahmoudzadeh, H., Terekhov, D.: Robust inverse optimization. Oper. Res. Lett. 46(3), 339\u2013344 (2018)","journal-title":"Oper. Res. Lett."},{"key":"1721_CR18","unstructured":"Shahmoradi, Z., Lee, T.: Quantile inverse optimization: improving stability in inverse linear programming (2020). URL https:\/\/arxiv.org\/abs\/1908.02376"},{"issue":"3","key":"1721_CR19","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1016\/j.ejor.2020.08.048","volume":"290","author":"K Ghobadi","year":"2020","unstructured":"Ghobadi, K., Mahmoudzadeh, H.: Inferring linear feasible regions using inverse optimization. Eur. J. Oper. Res. 290(3), 829\u2013843 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"1721_CR20","doi-asserted-by":"crossref","unstructured":"Keshavarz, A., Wang, Y., Boyd, S.: Imputing a convex objective function. In: 2011 IEEE international symposium on intelligent control (ISIC), pp. 613\u2013619. IEEE (2011)","DOI":"10.1109\/ISIC.2011.6045410"},{"key":"1721_CR21","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2019.0045","author":"A Babier","year":"2021","unstructured":"Babier, A., Chan, T.C.Y., Lee, T., Mahmood, R., Terekhov, D.: An ensemble learning framework for model fitting and evaluation in inverse linear optimization. INFORMS J. Optim. (2021). https:\/\/doi.org\/10.1287\/ijoo.2019.0045","journal-title":"INFORMS J. Optim."},{"issue":"6","key":"1721_CR22","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1016\/j.orl.2020.08.007","volume":"48","author":"M Moghaddass","year":"2020","unstructured":"Moghaddass, M., Terekhov, D.: Inverse integer optimization with an imperfect observation. Oper. Res. Lett. 48(6), 763\u2013769 (2020)","journal-title":"Oper. Res. Lett."},{"key":"1721_CR23","unstructured":"Bodur, M., Chan, T.C.Y., Zhu, I.Y.: Inverse mixed integer optimization: certificate sets and trust region methods (2020)"},{"key":"1721_CR24","unstructured":"Bulut, A., Ralphs, T.K.: On the complexity of inverse mixed integer linear optimization. Technical report, COR@ L Laboratory Report 15T-001-R3, Lehigh University (2016)"},{"key":"1721_CR25","doi-asserted-by":"publisher","DOI":"10.31274\/etd-180810-1183","volume-title":"Parallel Cutting Plane Algorithms for Inverse Mixed Integer Linear Programming","author":"Z Duan","year":"2009","unstructured":"Duan, Z.: Parallel Cutting Plane Algorithms for Inverse Mixed Integer Linear Programming. Iowa State University, Ames (2009)"},{"issue":"2","key":"1721_CR26","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10107-014-0819-4","volume":"153","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas, D., Gupta, V., Paschalidis, I.C.: Data-driven estimation in equilibrium using inverse optimization. Math. Program. 153(2), 595\u2013633 (2015)","journal-title":"Math. Program."},{"issue":"5","key":"1721_CR27","doi-asserted-by":"publisher","first-page":"4805","DOI":"10.1109\/TSG.2017.2671743","volume":"9","author":"J Saez-Gallego","year":"2017","unstructured":"Saez-Gallego, J., Morales, J.M.: Short-term forecasting of price-responsive loads using inverse optimization. IEEE Trans. Smart Grid 9(5), 4805\u20134814 (2017)","journal-title":"IEEE Trans. Smart Grid"},{"key":"1721_CR28","unstructured":"Tan, Y., Terekhov, D., Delong, A.: Learning linear programs from optimal decisions. In: Advances in Neural Information Processing Systems, vol 33 (2020)"},{"key":"1721_CR29","unstructured":"Dong, C., Zeng, B.: Expert learning through generalized inverse multiobjective optimization: Models, insights, and algorithms. In: Proceedings of the 37th International Conference on Machine Learning, volume 119 of Proceedings of Machine Learning Research, pp. 2648\u20132657. PMLR (2020)"},{"key":"1721_CR30","unstructured":"Ajayi, T., Lee, T., Schaefer, A.J.: An inverse optimization approach, objective selection for cancer treatment (2020)"},{"key":"1721_CR31","unstructured":"Dong, C., Chen, Y., Zeng, B.: Generalized inverse optimization through online learning. In: Advances in Neural Information Processing Systems, pp 86\u201395 (2018)"},{"key":"1721_CR32","unstructured":"B\u00e4rmann, A., Martin, A., Pokutta, S., Schneider, O:. An online-learning approach to inverse optimization (2020). arXiv preprintarXiv:1810.129972"},{"issue":"3","key":"1721_CR33","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1023\/B:JOCO.0000038914.26975.9b","volume":"8","author":"C Heuberger","year":"2004","unstructured":"Heuberger, C.: Inverse combinatorial optimization: a survey on problems, methods, and results. J. Comb. Optim. 8(3), 329\u2013361 (2004)","journal-title":"J. Comb. Optim."},{"key":"1721_CR34","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.dam.2019.01.001","volume":"260","author":"I Keshtkar","year":"2019","unstructured":"Keshtkar, I., Ghiyasvand, M.: Inverse quickest center location problem on a tree. Discrete Appl. Math. 260, 188\u2013202 (2019)","journal-title":"Discrete Appl. Math."},{"key":"1721_CR35","unstructured":"Ahmadian, S., Bhaskar, U., Sanit\u00e0, L., Swamy, C.: Algorithms for inverse optimization problems. In: 26th Annual European Symposium on Algorithms (ESA 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2018)"},{"issue":"3","key":"1721_CR36","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M.H., Schrijver, A., Tardos, \u00c9.: Sensitivity theorems in integer linear programming. Math. Program. 34(3), 251\u2013264 (1986)","journal-title":"Math. Program."},{"issue":"3","key":"1721_CR37","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s00493-007-2057-3","volume":"27","author":"S Ho\u015ften","year":"2007","unstructured":"Ho\u015ften, S., Sturmfels, B.: Computing the integer programming gap. Combinatorica 27(3), 367\u2013382 (2007)","journal-title":"Combinatorica"},{"key":"1721_CR38","unstructured":"Library, Q.: scipy.spatial.ConvexHull (2018). https:\/\/docs.scipy.org\/doc\/scipy-0.19.0\/reference\/generated\/scipy.spatial.ConvexHull.html"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01721-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-021-01721-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-021-01721-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,7]],"date-time":"2021-05-07T19:12:21Z","timestamp":1620414741000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-021-01721-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,23]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["1721"],"URL":"https:\/\/doi.org\/10.1007\/s11590-021-01721-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,23]]},"assertion":[{"value":"23 March 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 February 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}