{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,14]],"date-time":"2026-07-14T02:29:35Z","timestamp":1783996175378,"version":"3.55.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031931116","type":"print"},{"value":"9783031931123","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-93112-3_33","type":"book-chapter","created":{"date-parts":[[2025,6,10]],"date-time":"2025-06-10T04:56:17Z","timestamp":1749531377000},"page":"452-465","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Implied Integrality in Mixed-Integer Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5941-3016","authenticated-orcid":false,"given":"Rolf","family":"van\u00a0der\u00a0Hulst","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6615-5983","authenticated-orcid":false,"given":"Matthias","family":"Walter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,6,4]]},"reference":[{"key":"33_CR1","doi-asserted-by":"publisher","unstructured":"Achterberg, T.: Constraint Integer Programming. Ph.D. thesis, TU Berlin (2008). https:\/\/doi.org\/10.14279\/depositonce-1634","DOI":"10.14279\/depositonce-1634"},{"issue":"2","key":"33_CR2","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/ijoc.2018.0857","volume":"32","author":"T Achterberg","year":"2020","unstructured":"Achterberg, T., Bixby, R.E., Gu, Z., Rothberg, E., Weninger, D.: Presolve reductions in mixed integer programming. INFORMS J. Comput. 32(2), 473\u2013506 (2020). https:\/\/doi.org\/10.1287\/ijoc.2018.0857","journal-title":"INFORMS J. Comput."},{"issue":"1\u20133","key":"33_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0012-365X(03)00095-5","volume":"275","author":"G Appa","year":"2004","unstructured":"Appa, G., Kotnyek, B.: Rational and integral k-regular matrices. Discret. Math. 275(1\u20133), 1\u201315 (2004). https:\/\/doi.org\/10.1016\/S0012-365X(03)00095-5","journal-title":"Discret. Math."},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/s10107-017-1147-2","volume":"169","author":"J Bader","year":"2017","unstructured":"Bader, J., Hildebrand, R., Weismantel, R., Zenklusen, R.: Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix. Math. Program. 169(2), 565\u2013584 (2017). https:\/\/doi.org\/10.1007\/s10107-017-1147-2","journal-title":"Math. Program."},{"key":"33_CR5","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/BFb0121051","volume":"24","author":"E Balas","year":"1985","unstructured":"Balas, E.: On the facial structure of scheduling polyhedra. Math. Program. Study 24, 179\u2013218 (1985)","journal-title":"Math. Program. Study"},{"issue":"1\u20133","key":"33_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/BF01581273","volume":"58","author":"E Balas","year":"1993","unstructured":"Balas, E., Ceria, S., Cornu\u00e9jols, G.: A lift-and-project cutting plane algorithm for mixed 0\u20131 programs. Math. Program. 58(1\u20133), 295\u2013324 (1993). https:\/\/doi.org\/10.1007\/BF01581273","journal-title":"Math. Program."},{"issue":"3","key":"33_CR7","doi-asserted-by":"publisher","first-page":"527","DOI":"10.2307\/2946575","volume":"135","author":"LJ Billera","year":"1992","unstructured":"Billera, L.J., Sturmfels, B.: Fiber polytopes. Ann. Math. 135(3), 527\u2013549 (1992). https:\/\/doi.org\/10.2307\/2946575","journal-title":"Ann. Math."},{"key":"33_CR8","doi-asserted-by":"publisher","unstructured":"Bixby, R.E., Wagner, D.K.: An almost linear-time algorithm for graph realization. Math. Oper. Res. 13(1) (1988). https:\/\/doi.org\/10.1287\/moor.13.1.99","DOI":"10.1287\/moor.13.1.99"},{"key":"33_CR9","unstructured":"Bolusani, S., et\u00a0al.: The SCIP Optimization Suite 9.0 (2024)"},{"key":"33_CR10","doi-asserted-by":"publisher","unstructured":"Integer Programming. GTM, vol. 271. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"issue":"2","key":"33_CR11","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10107-007-0103-y","volume":"114","author":"G Ding","year":"2008","unstructured":"Ding, G., Feng, L., Zang, W.: The complexity of recognizing linear systems with certain integrality properties. Math. Program. 114(2), 321\u2013334 (2008). https:\/\/doi.org\/10.1007\/s10107-007-0103-y","journal-title":"Math. Program."},{"issue":"2","key":"33_CR12","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF03006558","volume":"11","author":"R Fortet","year":"1960","unstructured":"Fortet, R.: L\u2019algebre de Boole et ses applications en recherche operationnelle. Trabajos de Estadistica 11(2), 111\u2013118 (1960). https:\/\/doi.org\/10.1007\/BF03006558","journal-title":"Trabajos de Estadistica"},{"key":"33_CR13","volume-title":"Computers and Intractability A guide to the Theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability A guide to the Theory of NP-completeness. W.H. Freeman and Company, New York (1979)"},{"issue":"3","key":"33_CR14","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s12532-020-00194-3","volume":"13","author":"A Gleixner","year":"2021","unstructured":"Gleixner, A., et al.: MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library. Math. Program. Comput. 13(3), 443\u2013490 (2021). https:\/\/doi.org\/10.1007\/s12532-020-00194-3","journal-title":"Math. Program. Comput."},{"key":"33_CR15","unstructured":"Gomory, R.E.: An algorithm for the mixed-integer problem. Tech. Rep. RM-2597, RAND Corporation (1960)"},{"issue":"3","key":"33_CR16","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1002\/nav.3800150306","volume":"15","author":"WM Hirsch","year":"1968","unstructured":"Hirsch, W.M., Dantzig, G.B.: The fixed charge problem. Naval Res. Logistics Q. 15(3), 413\u2013424 (1968). https:\/\/doi.org\/10.1002\/nav.3800150306","journal-title":"Naval Res. Logistics Q."},{"key":"33_CR17","doi-asserted-by":"publisher","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Linear Inequalities and Related Systems, vol.\u00a038, pp. 223\u2013246. Princeton University Press (1956). https:\/\/doi.org\/10.1515\/9781400881987-014","DOI":"10.1515\/9781400881987-014"},{"issue":"1","key":"33_CR18","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s12532-017-0130-5","volume":"10","author":"Q Huangfu","year":"2017","unstructured":"Huangfu, Q., Hall, J.: Parallelizing the dual revised simplex method. Math. Program.\u00a0Comput. 10(1), 119\u2013142 (2017). https:\/\/doi.org\/10.1007\/s12532-017-0130-5","journal-title":"Math. Program.\u00a0Comput."},{"key":"33_CR19","unstructured":"van\u00a0der Hulst, R., Walter, M.: A row-wise algorithm for graph realization. arXiv:2408.12869 (2024). http:\/\/arxiv.org\/abs\/2408.12869"},{"key":"33_CR20","unstructured":"Hupp, L.M.: Integer and Mixed-Integer Reformulations of Stochastic, Resource-Constrained, and Quadratic Matching Problems. Ph.D. thesis, Friedrich-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg (2017)"},{"issue":"3","key":"33_CR21","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica 28(3), 497 (1960). https:\/\/doi.org\/10.2307\/1910129","journal-title":"Econometrica"},{"key":"33_CR22","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.disopt.2018.07.001","volume":"30","author":"ME L\u00fcbbecke","year":"2018","unstructured":"L\u00fcbbecke, M.E., Witt, J.T.: The strength of Dantzig-Wolfe reformulations for the stable set and related problems. Discret. Optim. 30, 168\u2013187 (2018). https:\/\/doi.org\/10.1016\/j.disopt.2018.07.001","journal-title":"Discret. Optim."},{"key":"33_CR23","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/BF01585518","volume":"7","author":"RR Meyer","year":"1974","unstructured":"Meyer, R.R.: On the existence of optimal solutions to integer and mixed-integer programming problems. Math. Program. 7, 223\u2013235 (1974). https:\/\/doi.org\/10.1007\/BF01585518","journal-title":"Math. Program."},{"key":"33_CR24","doi-asserted-by":"publisher","unstructured":"Paat, J., Schl\u00f6ter, M., Weismantel, R.: The integrality number of an integer program. Math. Program. 1\u201321 (2021). https:\/\/doi.org\/10.1007\/s10107-021-01651-0","DOI":"10.1007\/s10107-021-01651-0"},{"issue":"1","key":"33_CR25","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/BF02122701","volume":"10","author":"CH Papadimitriou","year":"1990","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On recognizing integer polyhedra. Combinatorica 10(1), 107\u2013109 (1990). https:\/\/doi.org\/10.1007\/BF02122701","journal-title":"Combinatorica"},{"key":"33_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. John Wiley & Sons Inc, New York (1986)"},{"key":"33_CR27","doi-asserted-by":"publisher","unstructured":"Truemper, K.: A decomposition theory for matroids. V. Testing of matrix total unimodularity. J. Comb. Theory, Series B 49(2), 241\u2013281 (1990). https:\/\/doi.org\/10.1016\/0095-8956(90)90030-4","DOI":"10.1016\/0095-8956(90)90030-4"},{"issue":"1","key":"33_CR28","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s12532-012-0048-x","volume":"5","author":"M Walter","year":"2013","unstructured":"Walter, M., Truemper, K.: Implementation of a unimodularity test. Math. Program. Comput. 5(1), 57\u201373 (2013). https:\/\/doi.org\/10.1007\/s12532-012-0048-x","journal-title":"Math. Program. Comput."}],"container-title":["Lecture Notes in Computer Science","Integer Programming and Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-93112-3_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T10:53:44Z","timestamp":1760007224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-93112-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031931116","9783031931123"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-93112-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"4 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IPCO","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integer Programming and Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Baltimore, MD","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 June 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ipco2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ipco25.cs.jhu.edu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}