{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T17:38:30Z","timestamp":1787506710431,"version":"build-2736575974"},"reference-count":8,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1016\/s0167-6377(98)00022-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:14:29Z","timestamp":1027624469000},"page":"13-19","source":"Crossref","is-referenced-by-count":8,"title":["Separating subdivision of bicycle wheel inequalities over cut polytopes"],"prefix":"10.1016","volume":"23","author":[{"given":"Eddie","family":"Cheng","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0167-6377(98)00022-4_BIB1","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Programm."},{"key":"10.1016\/S0167-6377(98)00022-4_BIB2","doi-asserted-by":"crossref","unstructured":"J. Cheriyan, W.H. Cunningham, L. Tun\u00e7el, Y. Wang, A linear programming and rounding approach to max 2-sat, in: D.S. Johnson, M.A. Trick (Eds.), Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence RI, 1996, pp. 395\u2013414.","DOI":"10.1090\/dimacs\/026\/19"},{"key":"10.1016\/S0167-6377(98)00022-4_BIB3","unstructured":"E. Cheng, Wheel inequalities for stable set polytopes, Ph.D. Thesis, University of Waterloo, 1995."},{"key":"10.1016\/S0167-6377(98)00022-4_BIB4","unstructured":"W.H. Cunningham, L. Tun\u00e7el, Y. Wang, A polyhedral approach to maximum 2-satisfiability, in preparation."},{"key":"10.1016\/S0167-6377(98)00022-4_BIB5","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"De Simone","year":"1989","journal-title":"Discrete Math."},{"key":"10.1016\/S0167-6377(98)00022-4_BIB6","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/moor.10.2.359","volume":"10","author":"Gerards","year":"1985","journal-title":"Math. Oper. Res."},{"key":"10.1016\/S0167-6377(98)00022-4_BIB7","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF01589101","volume":"45","author":"Padberg","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/S0167-6377(98)00022-4_BIB8","unstructured":"S. Saigal, Optimizing over the cut cone: a new polyhedral algorithm for the maximum-weight cut problem, Ph.D. Thesis, Rice University, 1991."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000224?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167637798000224?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:54:30Z","timestamp":1555563270000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167637798000224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":8,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["S0167637798000224"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6377(98)00022-4","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1998,8]]}}}