{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:48:50Z","timestamp":1770738530774,"version":"3.49.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1982,12,1]],"date-time":"1982-12-01T00:00:00Z","timestamp":407548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1982,12]]},"DOI":"10.1007\/bf01581034","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:55:29Z","timestamp":1114667729000},"page":"141-147","source":"Crossref","is-referenced-by-count":11,"title":["Finite checkability for integer rounding properties in combinatorial programming problems"],"prefix":"10.1007","volume":"22","author":[{"given":"S.","family":"Baum","sequence":"first","affiliation":[]},{"suffix":"Jr.","given":"L. E.","family":"Trotter","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF01581034_CR1","unstructured":"S.P. Baum, \u201cIntegral near-optimal solutions to certain classes of linear programming problems\u201d, Ph.D. Thesis, Cornell University School of OR\/IE Technical Report No. 360, (Ithaca, New York, 1977)."},{"key":"BF01581034_CR2","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-5060(08)70734-9","volume":"1","author":"J. Edmonds","year":"1977","unstructured":"J. Edmonds and R. Giles, \u201cA min\u2014max relation for submodular functions on graphs\u201d,Annals of Discrete Mathematics 1 (1977) 185\u2013204.","journal-title":"Annals of Discrete Mathematics"},{"key":"BF01581034_CR3","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01584085","volume":"1","author":"D.R. Fulkerson","year":"1971","unstructured":"D.R. Fulkerson, \u201cBlocking and anti-blocking pairs of polyhedra\u201d,Mathematical Programming 1 (1971) 168\u2013194.","journal-title":"Mathematical Programming"},{"key":"BF01581034_CR4","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/0095-8956(72)90032-9","volume":"12","author":"D.R. Fulkerson","year":"1972","unstructured":"D.R. Fulkerson, \u201cAnti-blocking polyhedra\u201d,Journal of Combinatorial Theory Series (B) 12 (1972) 50\u201371.","journal-title":"Journal of Combinatorial Theory Series (B)"},{"key":"BF01581034_CR5","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/B978-0-12-358350-5.50006-3","volume-title":"Mathematical Programming","author":"D.R. Fulkerson","year":"1973","unstructured":"D.R. Fulkerson, \u201cOn the Perfect Graph Theorem\u201d, in: T.C. Hu and S.M. Robinson, eds.Mathematical Programming (Academic Press, New York, 1973) pp. 69\u201377."},{"key":"BF01581034_CR6","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0095-8956(72)90045-7","volume":"13","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, \u201cA characterization of perfect graphs\u201d,Journal of Combinatorial Theory Series (B) 13 (1972) 95\u201399.","journal-title":"Journal of Combinatorial Theory Series (B)"},{"key":"BF01581034_CR7","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","volume":"2","author":"L. Lov\u00e1sz","year":"1972","unstructured":"L. Lov\u00e1sz, \u201cNormal hypergraphs and the perfect graph conjecture\u201d,Discrete Mathematics 2 (1972) 253\u2013267.","journal-title":"Discrete Mathematics"},{"key":"BF01581034_CR8","volume-title":"\u201cA polynomial algorithm for integer programming covering problems satisfying the integer round-up property\u201d, Sloan School of Management Technical Report","author":"J.B. Orlin","year":"1980","unstructured":"J.B. Orlin, \u201cA polynomial algorithm for integer programming covering problems satisfying the integer round-up property\u201d, Sloan School of Management Technical Report, M.I.T. (Cambridge, MA, 1980)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581034.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581034\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581034.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T15:27:59Z","timestamp":1581953279000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581034"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,12]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,12]]}},"alternative-id":["BF01581034"],"URL":"https:\/\/doi.org\/10.1007\/bf01581034","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1982,12]]}}}