{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T00:51:03Z","timestamp":1660265463101},"reference-count":8,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1016\/s0377-2217(01)00212-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T06:08:03Z","timestamp":1027577283000},"page":"310-325","source":"Crossref","is-referenced-by-count":4,"title":["On the linear description of the 3-cycle polytope"],"prefix":"10.1016","volume":"137","author":[{"given":"Viet Hung","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Jean-Fran\u00e7ois","family":"Maurras","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(01)00212-0_BIB1","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1287\/moor.22.1.110","article-title":"The circuit polytope: Facets","volume":"22","author":"Bauer","year":"1997","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(01)00212-0_BIB2","unstructured":"P. Bauer, J. Linderoth, M. Savelsbergh, A branch and cut approach to the cardinality constrained circuit problem (CCCP), Technical Report, School of Industrial and Systems Engineering, Georgia Institute of Technology, March 1998"},{"key":"10.1016\/S0377-2217(01)00212-0_BIB3","unstructured":"K. Fukuda, cdd\/cdd+Reference Manual, Technical Report, Institute for Operations Research, ETH-Zentrum, CH-8092 Zurich, Switzerland http:\/\/www.ifor.math.ethz.ch\/ifor\/staff\/fukuda\/cddman\/cddman.html, December 1997"},{"key":"10.1016\/S0377-2217(01)00212-0_BIB4","unstructured":"M. Kovalev, J.-F. Maurras, Y. Vax\u00e8s, On the convex hull of the 3-cycle of the complet graph, Technical Report 251, Laboratoire d' Informatique de Marseille, Facult\u00e9 des sciences de Luminy, 1997"},{"issue":"2","key":"10.1016\/S0377-2217(01)00212-0_BIB5","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF01584985","article-title":"Optimization of the flow through networks with gains","volume":"3","author":"Maurras","year":"1972","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(01)00212-0_BIB6","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(01)00212-0_BIB7","unstructured":"V.H. Nguyen and J.-F. Maurras, On the linear description of the k-cycle polytope, International Transactions in Operational Research forthcoming"},{"key":"10.1016\/S0377-2217(01)00212-0_BIB8","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1007\/BF01580441","article-title":"Facets for a linear inequality in 0\u20131 variables","volume":"8","author":"Wolsey","year":"1975","journal-title":"Mathematical Programming"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002120?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221701002120?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T04:26:26Z","timestamp":1556857586000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221701002120"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["S0377221701002120"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(01)00212-0","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}