{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T11:09:21Z","timestamp":1772622561772,"version":"3.50.1"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,10,13]],"date-time":"2012-10-13T00:00:00Z","timestamp":1350086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2012,12]]},"DOI":"10.1007\/s10107-012-0605-0","type":"journal-article","created":{"date-parts":[[2012,10,17]],"date-time":"2012-10-17T15:42:10Z","timestamp":1350488530000},"page":"301-323","source":"Crossref","is-referenced-by-count":8,"title":["The quadratic Graver cone, quadratic integer minimization, and extensions"],"prefix":"10.1007","volume":"136","author":[{"given":"Jon","family":"Lee","sequence":"first","affiliation":[]},{"given":"Shmuel","family":"Onn","sequence":"additional","affiliation":[]},{"given":"Lyubov","family":"Romanchuk","sequence":"additional","affiliation":[]},{"given":"Robert","family":"Weismantel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,13]]},"reference":[{"key":"605_CR1","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":"605_CR2","doi-asserted-by":"crossref","first-page":"1569","DOI":"10.1016\/j.jpaa.2008.11.033","volume":"213","author":"J Loera De","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":"605_CR3","unstructured":"De Loera, J., Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming. Discret. Optim. 5, 231\u2013241 (2008) (Volume in memory of George B. Dantzig)"},{"key":"605_CR4","doi-asserted-by":"crossref","first-page":"806","DOI":"10.1137\/040610623","volume":"17","author":"J Loera De","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":"605_CR5","doi-asserted-by":"crossref","unstructured":"Dobra, A., Fienberg, S.E., Rinaldo, A., Slavkovi\u0107, A., Zhou, Y.: Algebraic statistics and contingency table problems: log-linear models, likelihood estimation, and disclosure limitation. In: Emerging Applications of Algebraic Geometry: IMA Volumes in Mathematics and its Applications, vol. 148, pp. 63\u201388. Springer, Berlin (2009)","DOI":"10.1007\/978-0-387-09686-5_3"},{"key":"605_CR6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01442864","volume":"6","author":"P Gordan","year":"1873","unstructured":"Gordan, P.: \u00dcber die Aufl\u00f6sung linearer Gleichungen mit reellen Coefficienten. Math. Ann. 6, 23\u201328 (1873)","journal-title":"Math. Ann."},{"key":"605_CR7","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01681344","volume":"9","author":"JE Graver","year":"1975","unstructured":"Graver, J.E.: On the foundation of linear and integer programming I. Math. Program. 9, 207\u2013226 (1975)","journal-title":"Math. Program."},{"key":"605_CR8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/s10107-009-0276-7","volume":"126","author":"R Hemmecke","year":"2011","unstructured":"Hemmecke, R., Onn, S., Weismantel, R.: A polynomial oracle-time algorithm for convex integer minimization. Math. Program. 126, 97\u2013117 (2011)","journal-title":"Math. Program."},{"key":"605_CR9","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1007\/s11590-010-0231-9","volume":"5","author":"R Hemmecke","year":"2011","unstructured":"Hemmecke, R., Onn, S., Weismantel, R.: N-fold integer programming and nonlinear multi-transshipment. Optim. Lett. 5, 13\u201325 (2011)","journal-title":"Optim. Lett."},{"key":"605_CR10","first-page":"494","volume":"58","author":"TS Motzkin","year":"1952","unstructured":"Motzkin, T.S.: The multi-index transportation problem. Bull. Am. Math. Soc. 58, 494 (1952)","journal-title":"Bull. Am. Math. Soc."},{"key":"605_CR11","doi-asserted-by":"crossref","DOI":"10.4171\/093","volume-title":"Nonlinear Discrete Optimization. Zurich Lectures in Advanced Mathematics","author":"S Onn","year":"2010","unstructured":"Onn, S.: Nonlinear Discrete Optimization. Zurich Lectures in Advanced Mathematics. European Mathematical Society, Zurich (2010)"},{"key":"605_CR12","volume-title":"Theory of Linear and Integer Programming","author":"A Schrijver","year":"1986","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, New York (1986)"},{"key":"605_CR13","unstructured":"Seb\u00f6, A.: Hilbert bases, Carath\u00e9odory\u2019s theorem and combinatorial optimization. In: Proc. IPCO 1\u20131st Conference on Integer Programming and Combinatorial Optimization, pp. 431\u2013455. University of Waterloo Press, Waterloo (1990)"},{"key":"605_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":"605_CR15","volume-title":"Algebra","author":"BL Waerden Van Der","year":"1970","unstructured":"Van Der Waerden, B.L.: Algebra. Frederick Ungar Publishing, New York (1970)"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0605-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-012-0605-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-012-0605-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:00:01Z","timestamp":1559124001000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-012-0605-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,13]]},"references-count":15,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,12]]}},"alternative-id":["605"],"URL":"https:\/\/doi.org\/10.1007\/s10107-012-0605-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,13]]}}}