{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,28]],"date-time":"2026-04-28T17:55:10Z","timestamp":1777398910310,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,9,7]],"date-time":"2010-09-07T00:00:00Z","timestamp":1283817600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s11590-010-0231-9","type":"journal-article","created":{"date-parts":[[2010,9,6]],"date-time":"2010-09-06T07:09:35Z","timestamp":1283756975000},"page":"13-25","source":"Crossref","is-referenced-by-count":6,"title":["N-fold integer programming and nonlinear multi-transshipment"],"prefix":"10.1007","volume":"5","author":[{"given":"Raymond","family":"Hemmecke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shmuel","family":"Onn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,9,7]]},"reference":[{"key":"231_CR1","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1111\/1467-842X.00278","volume":"45","author":"S. Aoki","year":"2003","unstructured":"Aoki S., Takemura A.: Minimal basis for connected Markov chain over 3\u00a0\u00d7\u00a03\u00a0\u00d7 K contingency tables with fixed two-dimensional marginals. Aust. N. Z. J. Stat. 45, 229\u2013249 (2003)","journal-title":"Aust. N. Z. J. Stat."},{"key":"231_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s00026-009-0029-6","volume":"13","author":"Y. Berstein","year":"2009","unstructured":"Berstein Y., Onn S.: The Graver complexity of integer programming. Ann. Comb. 13, 289\u2013296 (2009)","journal-title":"Ann. Comb."},{"key":"231_CR3","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2006.06.006","volume":"5","author":"J. De Loera","year":"2008","unstructured":"De Loera J., Hemmecke R., Onn S., Weismantel R.: N-fold integer programming. Disc. Optim. 5, 231\u2013241 (2008) (volume in memory of George B. Dantzig)","journal-title":"Disc. Optim."},{"key":"231_CR4","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1016\/j.jpaa.2008.11.033","volume":"213","author":"J. De Loera","year":"2009","unstructured":"De Loera J., Hemmecke R., Onn S., Rothblum U.G., Weismantel R.: Convex integer maximization via Graver bases. J. Pure Appl. Algebra 213, 1569\u20131577 (2009)","journal-title":"J. Pure Appl. Algebra"},{"key":"231_CR5","doi-asserted-by":"crossref","first-page":"819","DOI":"10.1137\/S0097539702403803","volume":"33","author":"J. De Loera","year":"2004","unstructured":"De Loera J., Onn S.: The complexity of three-way statisticaltables. SIAM J. Comp. 33, 819\u2013836 (2004)","journal-title":"SIAM J. Comp."},{"key":"231_CR6","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1137\/040610623","volume":"17","author":"J. De Loera","year":"2006","unstructured":"De Loera J., Onn S.: All linear and integer programs are slim 3-way transportation programs. SIAM J. Optim. 17, 806\u2013821 (2006)","journal-title":"SIAM J. Optim."},{"key":"231_CR7","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/j.jsc.2005.04.010","volume":"41","author":"J. De Loera","year":"2006","unstructured":"De Loera J., Onn S.: Markov bases of three-way tables are arbitrarily complicated. J. Symb. Comp. 41, 173\u2013181 (2006)","journal-title":"J. Symb. Comp."},{"key":"231_CR8","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01681344","volume":"9","author":"J.E. Graver","year":"1975","unstructured":"Graver J.E.: On the foundation of linear and integer programming I. Math. Prog. 9, 207\u2013226 (1975)","journal-title":"Math. Prog."},{"key":"231_CR9","doi-asserted-by":"crossref","unstructured":"Hemmecke, R., Onn, S., Weismantel, R.: A polynomial oracle-time algorithm for convex integer minimization. Math. Prog. (To appear)","DOI":"10.1007\/s10107-009-0276-7"},{"key":"231_CR10","doi-asserted-by":"crossref","unstructured":"Hoffman, A.J., Kruskal, J.B.: Integral boundary points of convex polyhedra. In: Linear Inequalities and Related Systems. Ann. Math. Stud., vol. 38, pp. 223\u2013246. Princeton University Press, Princeton (1956)","DOI":"10.1515\/9781400881987-014"},{"key":"231_CR11","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/j.jcta.2006.06.001","volume":"114","author":"S. Ho\u015ften","year":"2007","unstructured":"Ho\u015ften S., Sullivant S.: Finiteness theorems for Markov bases of hierarchical models. J. Comb. Theory Ser. A 114, 311\u2013321 (2007)","journal-title":"J. Comb. Theory Ser. A"},{"key":"231_CR12","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1145\/331524.331526","volume":"46","author":"T. Leighton","year":"1999","unstructured":"Leighton T., Rao S.: Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. J. Assoc. Comp. Mach. 46, 787\u2013832 (1999)","journal-title":"J. Assoc. Comp. Mach."},{"key":"231_CR13","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/moor.8.4.538","volume":"8","author":"H.W. Lenstra Jr","year":"1983","unstructured":"Lenstra H.W. Jr: Integer programming with a fixed number ofvariables. Math. Oper. Res. 8, 538\u2013548 (1983)","journal-title":"Math. Oper. Res."},{"key":"231_CR14","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0097-3165(03)00092-X","volume":"103","author":"F. Santos","year":"2003","unstructured":"Santos F., Sturmfels B.: Higher Lawrence configurations. J. Comb. Theory Ser. A 103, 151\u2013164 (2003)","journal-title":"J. Comb. Theory Ser. A"},{"key":"231_CR15","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"Schrijver A.: Theory of Linear and Integer Programming. Wiley, Chichester (1986)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0231-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-010-0231-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-010-0231-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T22:04:53Z","timestamp":1559599493000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-010-0231-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,9,7]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["231"],"URL":"https:\/\/doi.org\/10.1007\/s11590-010-0231-9","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,9,7]]}}}