{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:34:24Z","timestamp":1787315664309,"version":"build-2736575974"},"reference-count":7,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1978,1,1]],"date-time":"1978-01-01T00:00:00Z","timestamp":252460800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12981,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1978]]},"DOI":"10.1016\/0012-365x(78)90193-0","type":"journal-article","created":{"date-parts":[[2002,10,8]],"date-time":"2002-10-08T11:17:01Z","timestamp":1034075821000},"page":"147-151","source":"Crossref","is-referenced-by-count":7,"title":["Minimal inequalities for mixed integer programs"],"prefix":"10.1016","volume":"24","author":[{"given":"Charles E.","family":"Blair","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(78)90193-0_BIB1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1016\/0024-3795(69)90017-2","article-title":"Some polyhedra related to combinatorial problems","volume":"2","author":"Gomory","year":"1969","journal-title":"Linear Alg. Appl."},{"key":"10.1016\/0012-365X(78)90193-0_BIB2_1","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/BF01584976","article-title":"Some continous functions related to corner polyhedra I and II","volume":"3","author":"Gomory","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/0012-365X(78)90193-0_BIB2_2","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/BF01585008","volume":"3","author":"Gomory","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/0012-365X(78)90193-0_BIB3","doi-asserted-by":"crossref","unstructured":"E.L. Johnson, The group problem for needed integer programming, Mathematical Programming Study 2 137\u2013179.","DOI":"10.1007\/BFb0120692"},{"key":"10.1016\/0012-365X(78)90193-0_BIB4","unstructured":"R.G. Jeroslow, Minimal inequalities, Management Science Research Report No. 362, GSIA, Carnegie-Mellon University."},{"key":"10.1016\/0012-365X(78)90193-0_BIB5","first-page":"268","article-title":"Convexity and Codinization I","author":"Stoer","year":"1970"},{"key":"10.1016\/0012-365X(78)90193-0_BIB6","series-title":"Principles of cutting-plane theory","author":"Jeroslow","year":"1974"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901930?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X78901930?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,6]],"date-time":"2020-03-06T14:18:35Z","timestamp":1583504315000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X78901930"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1978]]}},"alternative-id":["0012365X78901930"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(78)90193-0","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1978]]}}}