{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:36:17Z","timestamp":1759847777877},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,2,1]],"date-time":"2005-02-01T00:00:00Z","timestamp":1107216000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,2]]},"DOI":"10.1007\/s10878-005-5484-3","type":"journal-article","created":{"date-parts":[[2005,2,16]],"date-time":"2005-02-16T22:08:53Z","timestamp":1108591733000},"page":"59-67","source":"Crossref","is-referenced-by-count":7,"title":["Separating Type-I Odd-Cycle Inequalities for a Binary-Encoded Edge-Coloring Formulation"],"prefix":"10.1007","volume":"9","author":[{"given":"Jon","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Janny","family":"Leung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"de Vries","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"D. Coppersmith and J. Lee ?Indivisibility and Divisibility Polytopes,? in Novel Approaches to Hard Discrete Optimization, vol. 37, P.M. Pardalos and H. Wolkowicz (Eds.), Fields Institute Communications Series: American Mathematical Society, 2003, pp. 71?95.","DOI":"10.1090\/fic\/037\/05"},{"issue":"2\/3","key":"CR2","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0012-365X(84)90078-5","volume":"52","author":"A. Ehrenfeucht","year":"1984","unstructured":"A. Ehrenfeucht, V. Faber, and H.A. Kierstead ?A new method of proving theorems on chromatic index,? Discrete Math., vol. 52, nos. 2\/3, pp. 159?164, 1984.","journal-title":"Discrete Math."},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","volume":"34","author":"M.L. Fredman","year":"1987","unstructured":"M.L. Fredman and R.E. Tarjan ?Fibonacci heaps and their uses in improved network optimization algorithms,? J. Assoc. Comput. Mach., vol. 34, no. 3, pp. 596?615, 1987.","journal-title":"J. Assoc. Comput. Mach."},{"key":"CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-78240-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1993","unstructured":"M. Gr\u00f6tschel, L. Lov?sz, and A. Schrijver Geometric Algorithms and Combinatorial Optimization, Springer-Verlag: Berlin, 2nd edn., 1993.","edition":"2"},{"issue":"4","key":"CR5","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0210055","volume":"10","author":"I. Holyer","year":"1981","unstructured":"I. Holyer ?The NP-completeness of edge-coloring,?SIAM J. Comput., vol. 10, no. 4, pp. 718?720, 1981.","journal-title":"SIAM J. Comput."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1014804110661","volume":"6","author":"J. Lee","year":"2002","unstructured":"J. Lee ?All-different polytopes,? Journal of Combinatorial Optimization, vol. 6, pp. 335?352, 2002.","journal-title":"Journal of Combinatorial Optimization"},{"key":"CR7","unstructured":"J. Lee and J. Leung ?Edge coloring polyhedra,? Technical Report No. 90?01. Yale University, Department of Operations Research, 1990."},{"issue":"4","key":"CR8","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0167-6377(93)90043-G","volume":"13","author":"J. Lee","year":"1993","unstructured":"J. Lee and J. Leung ?A comparison of two edge-coloring formulations,? Oper. Res. Lett., vol. 13, no. 4, pp. 215?223, 1993.","journal-title":"Oper. Res. Lett."},{"issue":"6","key":"CR9","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-6377(91)90003-8","volume":"10","author":"G.L. Nemhauser","year":"1991","unstructured":"G.L. Nemhauser and S. Park ?A polyhedral approach to edge coloring,? Oper. Res. Lett., vol. 10, no. 6, pp. 315?322, 1991.","journal-title":"Oper. Res. Lett."},{"key":"CR10","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1999","unstructured":"G.L. Nemhauser and L.A. Wolsey Integer and Combinatorial Optimization, John Wiley & Sons Inc.: New York, 1999. Reprint of the 1988 original, A Wiley-Interscience Publication."},{"key":"CR11","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"V.G. Vizing ?On an estimate of the chromatic classof a p-graph,? Diskret. Analiz.,vol. 3, pp. 25?30, 1964.","journal-title":"Diskret. Analiz."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5484-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-5484-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-5484-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T20:06:12Z","timestamp":1586117172000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-5484-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,2]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2005,2]]}},"alternative-id":["5484"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-5484-3","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,2]]}}}