{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,10]],"date-time":"2024-07-10T19:46:50Z","timestamp":1720640810703},"reference-count":6,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1999,5,1]],"date-time":"1999-05-01T00:00:00Z","timestamp":925516800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electronic Notes in Discrete Mathematics"],"published-print":{"date-parts":[[1999,5]]},"DOI":"10.1016\/s1571-0653(05)80043-5","type":"journal-article","created":{"date-parts":[[2005,4,30]],"date-time":"2005-04-30T11:22:13Z","timestamp":1114860133000},"page":"142-145","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Polyhedral Sets and Integer Rounding"],"prefix":"10.1016","volume":"3","author":[{"given":"Thomas","family":"Niessen","sequence":"first","affiliation":[]},{"given":"Jaakob","family":"Kind","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1571-0653(05)80043-5_BIB1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","article-title":"Integer rounding for polymatroid and branching optimization problems","volume":"2","author":"Baum","year":"1981","journal-title":"SIAM J. Algebraic Disc. Meths."},{"key":"10.1016\/S1571-0653(05)80043-5_BIB2","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1007\/BF02614444","article-title":"Fractional and integral colourings","volume":"76","author":"Kilakos","year":"1997","journal-title":"Math. Programming"},{"key":"10.1016\/S1571-0653(05)80043-5_BIB3","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lov\u00e1sz","year":"1972","journal-title":"Disc. Math."},{"key":"10.1016\/S1571-0653(05)80043-5_BIB4","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1007\/BF02128672","article-title":"Colouring series-parallel graphs","volume":"10","author":"Seymour","year":"1990","journal-title":"Combinatorica"},{"key":"10.1016\/S1571-0653(05)80043-5_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01582578","article-title":"Near-perfect matrices","volume":"64","author":"Shepherd","year":"1994","journal-title":"Math. Programming"},{"key":"10.1016\/S1571-0653(05)80043-5_BIB6","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0012-365X(85)90052-4","article-title":"An O(qn) algorithm to q-color a proper family of circular arcs","volume":"55","author":"Teng","year":"1985","journal-title":"Disc. Math."}],"container-title":["Electronic Notes in Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800435?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1571065305800435?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T20:23:45Z","timestamp":1548534225000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1571065305800435"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,5]]},"references-count":6,"alternative-id":["S1571065305800435"],"URL":"https:\/\/doi.org\/10.1016\/s1571-0653(05)80043-5","relation":{},"ISSN":["1571-0653"],"issn-type":[{"value":"1571-0653","type":"print"}],"subject":[],"published":{"date-parts":[[1999,5]]}}}