{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,22]],"date-time":"2026-06-22T20:45:40Z","timestamp":1782161140819,"version":"3.54.5"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T00:00:00Z","timestamp":1534809600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100005156","name":"Alexander von Humboldt-Stiftung","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100005156","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2020,1]]},"DOI":"10.1007\/s10107-018-1323-z","type":"journal-article","created":{"date-parts":[[2018,8,21]],"date-time":"2018-08-21T14:20:53Z","timestamp":1534861253000},"page":"455-468","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Distances between optimal solutions of mixed-integer programs"],"prefix":"10.1007","volume":"179","author":[{"given":"Joseph","family":"Paat","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Weltge","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,21]]},"reference":[{"key":"1323_CR1","unstructured":"Andr\u00e1s, M.: Matroid Metszetek Pakol\u00e1sa. Master\u2019s thesis, E\u00f6tv\u00f6s Lor\u00e1nd Tudom\u00e1nyegyetem Term\u00e9szettudom\u00e1nyi Kar (2015)"},{"key":"1323_CR2","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1016\/0024-3795(95)00172-N","volume":"226\u2013228","author":"R Baldick","year":"1995","unstructured":"Baldick, R.: Refined proximity and sensitivity results in linearly constrained convex separable integer programming. Linear Algebra Its Appl. 226\u2013228, 389\u2013407 (1995)","journal-title":"Linear Algebra Its Appl."},{"key":"1323_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/0012-365X(77)90028-0","volume":"19","author":"C Blair","year":"1977","unstructured":"Blair, C., Jeroslow, R.: The value function of a mixed integer program: I. Discrete Math. 19, 121\u2013138 (1977)","journal-title":"Discrete Math."},{"key":"1323_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1016\/0012-365X(79)90147-X","volume":"25","author":"C Blair","year":"1979","unstructured":"Blair, C., Jeroslow, R.: The value function of a mixed integer program: II. Discrete Math. 25, 7\u201319 (1979)","journal-title":"Discrete Math."},{"key":"1323_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-319-11008-0","volume-title":"Integer Programming","author":"M Conforti","year":"2014","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming, vol. 271. Springer, Berlin (2014)"},{"key":"1323_CR6","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A., Schrijver, A., Tardos, E.: Sensitivity theorems in integer linear programming. Math. Program. 34, 251\u2013264 (1986)","journal-title":"Math. Program."},{"key":"1323_CR7","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/1.9781611975031.52","volume-title":"Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Friedrich Eisenbrand","year":"2018","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. In: Proceedings of the Twenty-Ninth Annual ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 808\u2013816 (2018)"},{"key":"1323_CR8","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF01580862","volume":"47","author":"F Granot","year":"1990","unstructured":"Granot, F., Skorin-Kapov, J.: Some proximity and sensitivity results in quadratic integer programming. Math. Program. 47, 259\u2013268 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"1323_CR9","doi-asserted-by":"publisher","first-page":"843","DOI":"10.1145\/96559.96597","volume":"37","author":"DS Hochbaum","year":"1990","unstructured":"Hochbaum, D.S., Shanthikumar, J.G.: Convex separable optimization is not much harder than linear optimization. J. ACM 37(4), 843\u2013862 (1990). https:\/\/doi.org\/10.1145\/96559.96597","journal-title":"J. ACM"},{"key":"1323_CR10","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1016\/0022-314X(69)90021-3","volume":"1","author":"JE Olson","year":"1969","unstructured":"Olson, J.E.: A combinatorial problem on finite abelian groups. I. J. Number Theory 1, 8\u201310 (1969)","journal-title":"J. Number Theory"},{"key":"1323_CR11","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"1323_CR12","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"S Veselov","year":"2009","unstructured":"Veselov, S., Chirkov, A.: Integer programming with bimodular matrix. Discrete Optim. 6, 220\u2013222 (2009)","journal-title":"Discrete Optim."},{"key":"1323_CR13","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01586929","volume":"51","author":"M Werman","year":"1991","unstructured":"Werman, M., Magagnosc, D.: The relationship between integer and real solutions of constrained convex programming. Math. Program. 51, 133\u2013135 (1991)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1323-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-018-1323-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-018-1323-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,4]],"date-time":"2023-09-04T13:29:42Z","timestamp":1693834182000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-018-1323-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,21]]},"references-count":13,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["1323"],"URL":"https:\/\/doi.org\/10.1007\/s10107-018-1323-z","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,8,21]]},"assertion":[{"value":"26 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}