{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,22]],"date-time":"2026-08-22T01:39:49Z","timestamp":1787362789614,"version":"build-2736575974"},"reference-count":14,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2015,1]]},"abstract":"<jats:p>Optimization over $l\\times m\\times n$ integer 3-way tables with given line-sums is NP-hard already for fixed $l=3$, but is polynomial time solvable with both $l,m$ fixed. In the huge version of the problem, the variable dimension $n$ is encoded in binary, with $t$ layer types. It was recently shown that the huge problem can be solved in polynomial time for fixed $t$, and the complexity of the problem for variable $t$ was raised as an open problem. Here we solve this problem and show that the huge table problem can be solved in polynomial time even when the number $t$ of types is variable. The complexity of the problem over 4-way tables with variable $t$ remains open, where all we know is that the associated decision problem is in NP intersect coNP. Our treatment goes through the more general class of huge $n$-fold integer programming problems. We show that huge integer programs over $n$-fold products of totally unimodular matrices can be solved in polynomial time even when the number $t$ of brick types is variable.<\/jats:p>","DOI":"10.1137\/151004227","type":"journal-article","created":{"date-parts":[[2015,12,2]],"date-time":"2015-12-02T14:16:47Z","timestamp":1449065807000},"page":"2277-2283","source":"Crossref","is-referenced-by-count":4,"title":["Huge Unimodular $n$-Fold Programs"],"prefix":"10.1137","volume":"29","author":[{"given":"Shmuel","family":"Onn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pauline","family":"Sarrabezolles","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2015,11,24]]},"reference":[{"key":"atypb1","doi-asserted-by":"publisher","DOI":"10.1111\/1467-842X.00278"},{"key":"atypb2","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2006.06.006"},{"key":"atypb3","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403803"},{"key":"atypb4","doi-asserted-by":"publisher","DOI":"10.1137\/040610623"},{"key":"atypb5","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2005.09.008"},{"key":"atypb6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.61"},{"key":"atypb7","first-page":"219","author":"Hemmecke R.","year":"2010","journal-title":"Berlin"},{"key":"atypb8","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-011-0490-y"},{"key":"atypb9","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0276-7"},{"key":"atypb10","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcta.2006.06.001"},{"key":"atypb11","first-page":"494","volume":"58","author":"Motzkin T. S.","year":"1952","journal-title":"Bull. Amer. Math. Soc."},{"key":"atypb12","doi-asserted-by":"crossref","unstructured":"S. Onn,\n                      Nonlinear Discrete Optimization: An Algorithmic Theory\n                      , Zur. Lect. Adv. Math., European Mathematical Society, Zu\u0308rich, 2010; available online at http:\/\/ie.technion.ac.il\/ onn\/Book\/NDO.pdf.","DOI":"10.4171\/093"},{"key":"atypb13","doi-asserted-by":"publisher","DOI":"10.1016\/j.disopt.2014.07.003"},{"key":"atypb14","doi-asserted-by":"publisher","DOI":"10.1016\/S0097-3165(03)00092-X"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/151004227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:47:42Z","timestamp":1787320062000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/151004227"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,1]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["10.1137\/151004227"],"URL":"https:\/\/doi.org\/10.1137\/151004227","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,1]]}}}