{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T03:48:32Z","timestamp":1768276112681,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T00:00:00Z","timestamp":1682467200000},"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":["Math. Program."],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10107-023-01955-3","type":"journal-article","created":{"date-parts":[[2023,4,26]],"date-time":"2023-04-26T14:05:42Z","timestamp":1682517942000},"page":"385-413","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Modeling combinatorial disjunctive constraints via junction trees"],"prefix":"10.1007","volume":"204","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9367-3751","authenticated-orcid":false,"given":"Bochuan","family":"Lyu","sequence":"first","affiliation":[]},{"given":"Illya V.","family":"Hicks","sequence":"additional","affiliation":[]},{"given":"Joey","family":"Huchette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,4,26]]},"reference":[{"issue":"6","key":"1955_CR1","doi-asserted-by":"publisher","first-page":"1477","DOI":"10.1287\/opre.1120.1106","volume":"60","author":"WP Adams","year":"2012","unstructured":"Adams, W.P., Henry, S.M.: Base-2 expansions for linearizing products of functions of discrete variables. Oper. Res. 60(6), 1477\u20131490 (2012)","journal-title":"Oper. Res."},{"issue":"2\u20133","key":"1955_CR2","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0166-218X(98)00039-0","volume":"86","author":"J Amilhastre","year":"1998","unstructured":"Amilhastre, J., Vilarem, M.C., Janssen, P.: Complexity of minimum biclique cover and minimum biclique decomposition for bipartite domino-free graphs. Discret. Appl. Math. 86(2\u20133), 125\u2013144 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"6","key":"1955_CR3","doi-asserted-by":"publisher","first-page":"941","DOI":"10.1287\/opre.17.6.941","volume":"17","author":"E Balas","year":"1969","unstructured":"Balas, E.: Machine sequencing via disjunctive graphs: an implicit enumeration algorithm. Oper. Res. 17(6), 941\u2013957 (1969)","journal-title":"Oper. Res."},{"key":"1955_CR4","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/B978-0-12-468650-2.50015-8","volume-title":"Nonlinear Programming","author":"E Balas","year":"1975","unstructured":"Balas, E.: Disjunctive programming: cutting planes from logical conditions. In: Nonlinear Programming, pp. 279\u2013312. Elsevier, New York (1975)"},{"key":"1955_CR5","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0167-5060(08)70342-X","volume":"5","author":"E Balas","year":"1979","unstructured":"Balas, E.: Disjunctive programming. Ann. Discret. Math. 5, 3\u201351 (1979)","journal-title":"Ann. Discret. Math."},{"issue":"1\u20133","key":"1955_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(98)00136-X","volume":"89","author":"E Balas","year":"1998","unstructured":"Balas, E.: Disjunctive programming: properties of the convex hull of feasible points. Discret. Appl. Math. 89(1\u20133), 3\u201344 (1998)","journal-title":"Discret. Appl. Math."},{"issue":"447\u2013454","key":"1955_CR7","first-page":"99","volume":"69","author":"EML Beale","year":"1970","unstructured":"Beale, E.M.L., Tomlin, J.A.: Special facilities in a general mathematical programming system for non-convex problems using ordered sets of variables. OR 69(447\u2013454), 99 (1970)","journal-title":"OR"},{"issue":"1","key":"1955_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10589-007-9126-9","volume":"43","author":"D Bertsimas","year":"2009","unstructured":"Bertsimas, D., Shioda, R.: Algorithm for cardinality-constrained quadratic optimization. Comput. Optim. Appl. 43(1), 1\u201322 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"1955_CR9","volume-title":"Systematic Methods for Chemical Process Design","author":"LT Biegler","year":"1997","unstructured":"Biegler, L.T., Grossmann, I.E., Westerberg, A.W.: Systematic Methods for Chemical Process Design. Prentice Hall, Old Tappan, NJ (United States) (1997)"},{"key":"1955_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"JA Bondy","year":"2008","unstructured":"Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Cham (2008)"},{"key":"1955_CR11","unstructured":"de\u00a0Caen, D., Gregory, D.A., Pullman, N.J.: The boolean rank of zero-one matrices. In: Proceedings of the Third Caribbean Conference on Combinatorics and Computing, Barbados, pp. 169\u2013173 (1981)"},{"key":"1955_CR12","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Heydrich, S., Holm, E., Karrenbauer, A.: Nearly tight approximability results for minimum biclique cover and partition. In: European Symposium on Algorithms, pp. 235\u2013246. Springer (2014)","DOI":"10.1007\/978-3-662-44777-2_20"},{"issue":"13","key":"1955_CR13","doi-asserted-by":"publisher","first-page":"1271","DOI":"10.1016\/S0305-0548(99)00074-X","volume":"27","author":"TJ Chang","year":"2000","unstructured":"Chang, T.J., Meade, N., Beasley, J.E., Sharaiha, Y.M.: Heuristics for cardinality constrained portfolio optimisation. Comput. Oper. Res. 27(13), 1271\u20131302 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"12\u201313","key":"1955_CR14","doi-asserted-by":"publisher","first-page":"1420","DOI":"10.1177\/0278364919846512","volume":"38","author":"H Dai","year":"2019","unstructured":"Dai, H., Izatt, G., Tedrake, R.: Global inverse kinematics via mixed-integer convex optimization. Int. J. Robot. Res. 38(12\u201313), 1420\u20131441 (2019)","journal-title":"Int. J. Robot. Res."},{"key":"1955_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04245-8","volume-title":"Computational Geometry: Algorithms and Applications","author":"MT De Berg","year":"2000","unstructured":"De Berg, M.T., Van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry: Algorithms and Applications. Springer, Cham (2000)"},{"key":"1955_CR16","doi-asserted-by":"crossref","unstructured":"Deits, R., Tedrake, R.: Footstep planning on uneven terrain with mixed-integer convex optimization. In: 2014 IEEE-RAS International Conference on Humanoid Robots, pp. 279\u2013286. IEEE (2014)","DOI":"10.1109\/HUMANOIDS.2014.7041373"},{"key":"1955_CR17","doi-asserted-by":"crossref","unstructured":"Deits, R., Tedrake, R.: Efficient mixed-integer planning for uavs in cluttered environments. In: 2015 IEEE International Conference on Robotics and Automation (ICRA), pp. 42\u201349. IEEE (2015)","DOI":"10.1109\/ICRA.2015.7138978"},{"key":"1955_CR18","volume-title":"Graph Theory with Applications to Engineering and Computer Science","author":"N Deo","year":"2017","unstructured":"Deo, N.: Graph Theory with Applications to Engineering and Computer Science. Courier Dover Publications, Mineola, New York (2017)"},{"key":"1955_CR19","doi-asserted-by":"publisher","DOI":"10.37236\/8316","author":"K Guo","year":"2019","unstructured":"Guo, K., Huynh, T., Macchia, M.: The biclique covering number of grids. Electron. J. Comb. (2019). https:\/\/doi.org\/10.37236\/8316","journal-title":"Electron. J. Comb."},{"issue":"3","key":"1955_CR20","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1287\/moor.2018.0946","volume":"44","author":"J Huchette","year":"2019","unstructured":"Huchette, J., Vielma, J.P.: A combinatorial approach for small and strong formulations of disjunctive constraints. Math. Oper. Res. 44(3), 793\u2013820 (2019)","journal-title":"Math. Oper. Res."},{"key":"1955_CR21","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1973","author":"J Huchette","year":"2022","unstructured":"Huchette, J., Vielma, J.P.: Nonconvex piecewise linear functions: advanced formulations and simple modeling tools. Oper. Res. (2022). https:\/\/doi.org\/10.1287\/opre.2019.1973","journal-title":"Oper. Res."},{"key":"1955_CR22","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/BFb0121015","volume-title":"Mathematical Programming at Oberwolfach II","author":"RG Jeroslow","year":"1984","unstructured":"Jeroslow, R.G., Lowe, J.K.: Modelling with integer variables. In: Mathematical Programming at Oberwolfach II, pp. 167\u2013184. Springer, Cham (1984)"},{"issue":"4","key":"1955_CR23","doi-asserted-by":"publisher","first-page":"650","DOI":"10.1016\/j.compchemeng.2005.11.005","volume":"30","author":"R Karuppiah","year":"2006","unstructured":"Karuppiah, R., Grossmann, I.E.: Global optimization for the synthesis of integrated water systems in chemical processes. Comput. Chem. Eng. 30(4), 650\u2013673 (2006)","journal-title":"Comput. Chem. Eng."},{"key":"1955_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-021-01652-z","author":"T Kis","year":"2021","unstructured":"Kis, T., Horv\u00e1th, M.: Ideal, non-extended formulations for disjunctive constraints admitting a network representation. Math. Program. (2021). https:\/\/doi.org\/10.1007\/s10107-021-01652-z","journal-title":"Math. Program."},{"key":"1955_CR25","first-page":"7","volume":"49","author":"D Kravitz","year":"2007","unstructured":"Kravitz, D.: Two comments on minimum spanning trees. Bull. ICA 49, 7\u201310 (2007)","journal-title":"Bull. ICA"},{"issue":"3","key":"1955_CR26","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/s10514-015-9479-3","volume":"40","author":"S Kuindersma","year":"2016","unstructured":"Kuindersma, S., Deits, R., Fallon, M., Valenzuela, A., Dai, H., Permenter, F., Koolen, T., Marion, P., Tedrake, R.: Optimization-based locomotion planning, estimation, and control design for the atlas humanoid robot. Auton. Robots 40(3), 429\u2013455 (2016)","journal-title":"Auton. Robots"},{"key":"1955_CR27","doi-asserted-by":"crossref","unstructured":"Mellinger, D., Kushleyev, A., Kumar, V.: Mixed-integer quadratic program trajectory generation for heterogeneous quadrotor teams. In: 2012 IEEE International Conference on Robotics and Automation, pp. 477\u2013483. IEEE (2012)","DOI":"10.1109\/ICRA.2012.6225009"},{"key":"1955_CR28","first-page":"198","volume":"1897","author":"H Minkowski","year":"1897","unstructured":"Minkowski, H.: Allgemeine lehrsatze uber die konvexen polyeder. Nachr. Ges. Wiss. Gott. Math. Phys. KL 1897, 198\u2013219 (1897)","journal-title":"Nachr. Ges. Wiss. Gott. Math. Phys. KL"},{"issue":"1","key":"1955_CR29","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1016\/j.orl.2012.10.005","volume":"41","author":"FM Muldoon","year":"2013","unstructured":"Muldoon, F.M., Adams, W.P., Sherali, H.D.: Ideal representations of lexicographic orderings and base-2 expansions of integer variables. Oper. Res. Lett. 41(1), 32\u201339 (2013)","journal-title":"Oper. Res. Lett."},{"issue":"1\u20133","key":"1955_CR30","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/0012-365X(94)00350-R","volume":"149","author":"H M\u00fcller","year":"1996","unstructured":"M\u00fcller, H.: On edge perfectness and classes of bipartite graphs. Discret. Math. 149(1\u20133), 159\u2013187 (1996)","journal-title":"Discret. Math."},{"key":"1955_CR31","first-page":"406","volume-title":"Indagationes Mathematicae (Proceedings)","author":"J Orlin","year":"1977","unstructured":"Orlin, J.: Contentment in graph theory: covering graphs with cliques. In: Indagationes Mathematicae (Proceedings), pp. 406\u2013424. Elsevier, New York (1977)"},{"issue":"9","key":"1955_CR32","doi-asserted-by":"publisher","first-page":"3037","DOI":"10.1021\/ie00048a015","volume":"34","author":"JM Pinto","year":"1995","unstructured":"Pinto, J.M., Grossmann, I.E.: A continuous time mixed integer linear programming model for short term scheduling of multistage batch plants. Ind. Eng. Chem. Res. 34(9), 3037\u20133051 (1995)","journal-title":"Ind. Eng. Chem. Res."},{"key":"1955_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-26995-5","volume-title":"Mixed-Integer Representations in Control Design: Mathematical Foundations and Applications","author":"I Prodan","year":"2016","unstructured":"Prodan, I., Stoican, F., Olaru, S., Niculescu, S.I.: Mixed-Integer Representations in Control Design: Mathematical Foundations and Applications. Springer, Cham (2016)"},{"issue":"7","key":"1955_CR34","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1016\/0098-1354(93)E0010-7","volume":"18","author":"R Raman","year":"1994","unstructured":"Raman, R., Grossmann, I.E.: Modelling and computational techniques for logic based integer programming. Comput. Chem. Eng. 18(7), 563\u2013578 (1994)","journal-title":"Comput. Chem. Eng."},{"issue":"1","key":"1955_CR35","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF02579163","volume":"4","author":"Z Tuza","year":"1984","unstructured":"Tuza, Z.: Covering of graphs by complete bipartite subgraphs; complexity of 0\u20131 matrices. Combinatorica 4(1), 111\u2013116 (1984)","journal-title":"Combinatorica"},{"issue":"1","key":"1955_CR36","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1137\/130915303","volume":"57","author":"JP Vielma","year":"2015","unstructured":"Vielma, J.P.: Mixed integer linear programming formulation techniques. Siam Rev. 57(1), 3\u201357 (2015)","journal-title":"Siam Rev."},{"issue":"10","key":"1955_CR37","doi-asserted-by":"publisher","first-page":"4721","DOI":"10.1287\/mnsc.2017.2856","volume":"64","author":"JP Vielma","year":"2018","unstructured":"Vielma, J.P.: Embedding formulations and complexity for unions of polyhedra. Manag. Sci. 64(10), 4721\u20134734 (2018)","journal-title":"Manag. Sci."},{"issue":"2","key":"1955_CR38","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1287\/opre.1090.0721","volume":"58","author":"JP Vielma","year":"2010","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.: Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions. Oper. Res. 58(2), 303\u2013315 (2010)","journal-title":"Oper. Res."},{"issue":"3","key":"1955_CR39","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/ijoc.1070.0256","volume":"20","author":"JP Vielma","year":"2008","unstructured":"Vielma, J.P., Ahmed, S., Nemhauser, G.L.: A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs. Inf. J. Comput. 20(3), 438\u2013450 (2008)","journal-title":"Inf. J. Comput."},{"issue":"1","key":"1955_CR40","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s10107-009-0295-4","volume":"128","author":"JP Vielma","year":"2011","unstructured":"Vielma, J.P., Nemhauser, G.L.: Modeling disjunctive constraints with a logarithmic number of binary variables and constraints. Math. Program. 128(1), 49\u201372 (2011)","journal-title":"Math. Program."},{"issue":"1","key":"1955_CR41","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF01292722","volume":"7","author":"H Weyl","year":"1934","unstructured":"Weyl, H.: Elementare theorie der konvexen polyeder. Comment. Math. Helv. 7(1), 290\u2013306 (1934)","journal-title":"Comment. Math. Helv."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-023-01955-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-023-01955-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,15]],"date-time":"2024-02-15T21:33:30Z","timestamp":1708032810000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-023-01955-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,4,26]]},"references-count":41,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["1955"],"URL":"https:\/\/doi.org\/10.1007\/s10107-023-01955-3","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,4,26]]},"assertion":[{"value":"13 May 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}