{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T22:22:16Z","timestamp":1778624536782,"version":"3.51.4"},"reference-count":36,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2027,3,9]],"date-time":"2027-03-09T00:00:00Z","timestamp":1804550400000},"content-version":"am","delay-in-days":312,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:00:00Z","timestamp":1777593600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000142112262"],"award-info":[{"award-number":["N000142112262"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2141064"],"award-info":[{"award-number":["2141064"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Discrete Optimization"],"published-print":{"date-parts":[[2026,5]]},"DOI":"10.1016\/j.disopt.2026.100943","type":"journal-article","created":{"date-parts":[[2026,3,9]],"date-time":"2026-03-09T13:32:23Z","timestamp":1773063143000},"page":"100943","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Inverse of the Gomory corner relaxation of integer programs"],"prefix":"10.1016","volume":"60","author":[{"given":"George","family":"Lyu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2043-7115","authenticated-orcid":false,"given":"Fatemeh","family":"Nosrat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew J.","family":"Schaefer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.disopt.2026.100943_b1","doi-asserted-by":"crossref","first-page":"1717","DOI":"10.1287\/opre.2021.2192","article-title":"Objective selection for cancer treatment: An inverse optimization approach","volume":"70","author":"Ajayi","year":"2022","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.disopt.2026.100943_b2","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.2014.1267","article-title":"Generalized inverse multiobjective optimization with application to cancer therapy","volume":"62","author":"Chan","year":"2014","journal-title":"Oper. Res."},{"issue":"4","key":"10.1016\/j.disopt.2026.100943_b3","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1287\/deca.1100.0185","article-title":"Eliciting patients\u2019 revealed preferences: An inverse Markov decision process approach","volume":"7","author":"Erkin","year":"2010","journal-title":"Decis. Anal."},{"key":"10.1016\/j.disopt.2026.100943_b4","series-title":"Complex Systems in Biomedicine","isbn-type":"print","first-page":"1","article-title":"Inverse problems in biomedical imaging: modeling and methods of solution","author":"Bertero","year":"2006","ISBN":"https:\/\/id.crossref.org\/isbn\/9788847003965"},{"key":"10.1016\/j.disopt.2026.100943_b5","series-title":"Inverse Problem Theory and Methods for Model Parameter Estimation","isbn-type":"print","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898717921","author":"Tarantola","year":"2005","ISBN":"https:\/\/id.crossref.org\/isbn\/9780898715729"},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b6","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1007\/s10107-014-0819-4","article-title":"Data-driven estimation in equilibrium using inverse optimization","volume":"153","author":"Bertsimas","year":"2015","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.disopt.2026.100943_b7","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s11590-009-0131-z","article-title":"Inverse integer programming","volume":"3","author":"Schaefer","year":"2009","journal-title":"Optim. Lett."},{"issue":"6","key":"10.1016\/j.disopt.2026.100943_b8","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1016\/j.orl.2015.08.010","article-title":"A polyhedral characterization of the inverse-feasible region of a mixed-integer program","volume":"43","author":"Lamperski","year":"2015","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.disopt.2026.100943_b9","series-title":"Algorithmic Applications in Management","isbn-type":"print","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11496199_45","article-title":"Inverse problems of some NP-complete problems","author":"Huang","year":"2005","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540324409"},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b10","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.orl.2008.12.001","article-title":"Cutting plane algorithms for the inverse mixed integer linear programming problem","volume":"37","author":"Wang","year":"2009","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/j.disopt.2026.100943_b11","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/s10898-010-9637-2","article-title":"Heuristic algorithms for the inverse mixed integer linear programming problem","volume":"51","author":"Duan","year":"2011","journal-title":"J. Global Optim."},{"issue":"3","key":"10.1016\/j.disopt.2026.100943_b12","doi-asserted-by":"crossref","first-page":"1471","DOI":"10.1287\/ijoc.2021.1138","article-title":"Inverse mixed integer optimization: Polyhedral insights and trust region methods","volume":"34","author":"Bodur","year":"2022","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b13","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0377-0427(95)00277-4","article-title":"Calculating some inverse linear programming problems","volume":"72","author":"Zhang","year":"1996","journal-title":"J. Comput. Appl. Math."},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b14","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/S0377-0427(99)00080-1","article-title":"A further study on inverse linear programming problems","volume":"106","author":"Zhang","year":"1999","journal-title":"J. Comput. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/0377-0427","issn-type":"print"},{"issue":"5","key":"10.1016\/j.disopt.2026.100943_b15","doi-asserted-by":"crossref","first-page":"771","DOI":"10.1287\/opre.49.5.771.10607","article-title":"Inverse optimization","volume":"49","author":"Ahuja","year":"2001","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b16","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.orl.2017.12.004","article-title":"On the structure of the inverse-feasible region of a linear program","volume":"46","author":"Tavasl\u0131o\u011flu","year":"2018","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"10.1016\/j.disopt.2026.100943_b17","doi-asserted-by":"crossref","first-page":"1115","DOI":"10.1287\/mnsc.2017.2992","article-title":"Inverse optimization: Closed-form solutions, geometry, and goodness of fit","volume":"65","author":"Chan","year":"2019","journal-title":"Manag. Sci."},{"issue":"4","key":"10.1016\/j.disopt.2026.100943_b18","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1016\/0024-3795(69)90017-2","article-title":"Some polyhedra related to combinatorial problems","volume":"2","author":"Gomory","year":"1969","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b19","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/s10107-003-0386-6","article-title":"Gomory integer programs","volume":"96","author":"Ho\u015ften","year":"2003","journal-title":"Math. Program."},{"key":"10.1016\/j.disopt.2026.100943_b20","series-title":"50 Years of Integer Programming 1958-2008: From the Early Years To the State-of-the-Art","isbn-type":"print","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1007\/978-3-540-68279-0_19","article-title":"The group-theoretic approach in mixed integer programming","author":"Richard","year":"2010","ISBN":"https:\/\/id.crossref.org\/isbn\/9783540682790"},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b21","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-003-0388-4","article-title":"Corner polyhedra and their connection with cutting planes","volume":"96","author":"Gomory","year":"2003","journal-title":"Math. Program.","ISSN":"https:\/\/id.crossref.org\/issn\/1436-4646","issn-type":"print"},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b22","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1016\/j.disopt.2006.11.010","article-title":"How tight is the corner relaxation?","volume":"5","author":"Fischetti","year":"2008","journal-title":"Discrete Optim."},{"issue":"2","key":"10.1016\/j.disopt.2026.100943_b23","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/j.disopt.2004.06.001","article-title":"Extended formulations for gomory corner polyhedra","volume":"1","author":"K\u00f6ppe","year":"2004","journal-title":"Discrete Optim."},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b24","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s10107-003-0402-x","article-title":"Binary clutter inequalities for integer programs","volume":"98","author":"Letchford","year":"2003","journal-title":"Math. Program."},{"issue":"6","key":"10.1016\/j.disopt.2026.100943_b25","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1287\/opre.24.6.1120","article-title":"Comparison of some algorithms for solving the group theoretic integer programming problem","volume":"24","author":"Chen","year":"1976","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b26","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/opre.16.1.103","article-title":"Dynamic programming algorithms for the integer programming problem\u2014I: The integer programming problem viewed as a knapsack type problem","volume":"16","author":"Shapiro","year":"1968","journal-title":"Oper. Res."},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b27","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF01585693","article-title":"On an instance of the inverse shortest paths problem","volume":"53","author":"Burton","year":"1992","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b28","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF03167381","article-title":"An inverse problem of the weighted shortest path problem","volume":"12","author":"Xu","year":"1995","journal-title":"Jpn. J. Ind. Appl. Math.","ISSN":"https:\/\/id.crossref.org\/issn\/1868-937X","issn-type":"print"},{"key":"10.1016\/j.disopt.2026.100943_b29","first-page":"293","article-title":"On systems of linear indeterminate equations and congruences","volume":"151","author":"Smith","year":"1861","journal-title":"Philos. Trans. R. Soc. Lond."},{"key":"10.1016\/j.disopt.2026.100943_b30","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1016\/j.jsc.2022.09.002","article-title":"A fast algorithm for computing the smith normal form with multipliers for a nonsingular integer matrix","volume":"116","author":"Birmpilis","year":"2023","journal-title":"J. Symbolic Comput."},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b31","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1006\/jsco.2001.0451","article-title":"On efficient sparse integer matrix smith normal form computations","volume":"32","author":"Dumas","year":"2001","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/j.disopt.2026.100943_b32","series-title":"Introduction to Linear Optimization","isbn-type":"print","author":"Bertsimas","year":"1997","ISBN":"https:\/\/id.crossref.org\/isbn\/9781886529199"},{"key":"10.1016\/j.disopt.2026.100943_b33","series-title":"Network Flows: Theory, Algorithms, and Applications","isbn-type":"print","author":"Ahuja","year":"1993","ISBN":"https:\/\/id.crossref.org\/isbn\/013617549X"},{"issue":"3","key":"10.1016\/j.disopt.2026.100943_b34","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","article-title":"MIPLIB 2017: Data-driven compilation of the 6th mixed integer programming library","volume":"13","author":"Gleixner","year":"2021","journal-title":"Math. Program. Comput."},{"key":"10.1016\/j.disopt.2026.100943_b35","series-title":"Gurobi Optimizer Reference Manual","author":"Gurobi Optimization, LLC","year":"2023"},{"issue":"1","key":"10.1016\/j.disopt.2026.100943_b36","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1287\/opre.35.1.140","article-title":"Technical note\u2014Recognizing unbounded integer programs","volume":"35","author":"Byrd","year":"1987","journal-title":"Oper. Res."}],"container-title":["Discrete Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000162?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1572528626000162?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T21:25:31Z","timestamp":1778621131000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1572528626000162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5]]},"references-count":36,"alternative-id":["S1572528626000162"],"URL":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100943","relation":{},"ISSN":["1572-5286"],"issn-type":[{"value":"1572-5286","type":"print"}],"subject":[],"published":{"date-parts":[[2026,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Inverse of the Gomory corner relaxation of integer programs","name":"articletitle","label":"Article Title"},{"value":"Discrete Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.disopt.2026.100943","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"100943"}}