{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T11:29:50Z","timestamp":1770982190878,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030218027","type":"print"},{"value":"9783030218034","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,6,15]],"date-time":"2019-06-15T00:00:00Z","timestamp":1560556800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-21803-4_44","type":"book-chapter","created":{"date-parts":[[2019,6,14]],"date-time":"2019-06-14T22:03:24Z","timestamp":1560549804000},"page":"438-447","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["On Proximity for k-Regular Mixed-Integer Linear Optimization"],"prefix":"10.1007","author":[{"given":"Luze","family":"Xu","sequence":"first","affiliation":[]},{"given":"Jon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,15]]},"reference":[{"key":"44_CR1","doi-asserted-by":"crossref","unstructured":"Aliev, I., Henk, M., Oertel, T.: Distances to lattice points in knapsack polyhedra. arXiv preprint \n                    arXiv:1805.04592\n                    \n                   (2018)","DOI":"10.1007\/s10107-019-01392-1"},{"issue":"3","key":"44_CR2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/BF01582230","volume":"34","author":"W Cook","year":"1986","unstructured":"Cook, W., Gerards, A.M., Schrijver, A., Tardos, \u00c9.: Sensitivity theorems in integer linear programming. Math. Program. 34(3), 251\u2013264 (1986)","journal-title":"Math. Program."},{"key":"44_CR3","doi-asserted-by":"crossref","unstructured":"Eisenbrand, F., Weismantel, R.: Proximity results and faster algorithms for integer programming using the Steinitz lemma. In: SODA. pp. 808\u2013816 (2018)","DOI":"10.1137\/1.9781611975031.52"},{"issue":"1\u20133","key":"44_CR4","doi-asserted-by":"crossref","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(1\u20133), 259\u2013268 (1990)","journal-title":"Math. Program."},{"issue":"4","key":"44_CR5","doi-asserted-by":"crossref","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)","journal-title":"J. ACM"},{"key":"44_CR6","unstructured":"Lee, J.: Subspaces with well-scaled frames. Ph.D. dissertation, Cornell University (1986)"},{"key":"44_CR7","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0024-3795(89)90450-3","volume":"114","author":"J Lee","year":"1989","unstructured":"Lee, J.: Subspaces with well-scaled frames. Linear Algebra Appl. 114, 21\u201356 (1989)","journal-title":"Linear Algebra Appl."},{"issue":"2","key":"44_CR8","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0095-8956(90)90082-B","volume":"50","author":"J Lee","year":"1990","unstructured":"Lee, J.: The incidence structure of subspaces with well-scaled frames. J. Comb. Theory Ser. B 50(2), 265\u2013287 (1990)","journal-title":"J. Comb. Theory Ser. B"},{"key":"44_CR9","doi-asserted-by":"publisher","unstructured":"Paat, J., Weismantel, R., Weltge, S.: Distances between optimal solutions of mixed-integer programs. Math. Program. \n                    https:\/\/doi.org\/10.1007\/s10107-018-1323-z\n                    \n                   (2018)","DOI":"10.1007\/s10107-018-1323-z"},{"key":"44_CR10","unstructured":"Rockafellar, R.T.: The elementary vectors of a subspace of \n                    \n                      \n                    \n                    $${\\mathbb{R}}^n$$\n                  . In: Combinatorial Mathematics and Its Applications, pp. 104\u2013127. University of North Carolina Press (1969)"},{"key":"44_CR11","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley (1998)"},{"issue":"2","key":"44_CR12","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/j.disopt.2008.12.002","volume":"6","author":"SI Veselov","year":"2009","unstructured":"Veselov, S.I., Chirkov, A.J.: Integer program with bimodular matrix. Discrete Optim. 6(2), 220\u2013222 (2009)","journal-title":"Discrete Optim."},{"issue":"1","key":"44_CR13","doi-asserted-by":"crossref","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. Prog. 51(1), 133\u2013135 (1991)","journal-title":"Math. Prog."},{"issue":"1","key":"44_CR14","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(82)90033-6","volume":"4","author":"T Zaslavsky","year":"1982","unstructured":"Zaslavsky, T.: Signed graphs. Discrete Appl. Math. 4(1), 47\u201374 (1982)","journal-title":"Discrete Appl. Math."}],"container-title":["Advances in Intelligent Systems and Computing","Optimization of Complex Systems: Theory, Models, Algorithms and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-21803-4_44","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T05:50:06Z","timestamp":1572587406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-21803-4_44"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,15]]},"ISBN":["9783030218027","9783030218034"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-21803-4_44","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"value":"2194-5357","type":"print"},{"value":"2194-5365","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,6,15]]},"assertion":[{"value":"15 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WCGO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"World Congress on Global Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Metz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wcgo2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}