{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:22:03Z","timestamp":1648639323804},"reference-count":27,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO-Oper. Res."],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1051\/ro\/2015053","type":"journal-article","created":{"date-parts":[[2015,11,13]],"date-time":"2015-11-13T07:36:23Z","timestamp":1447400183000},"page":"627-644","source":"Crossref","is-referenced-by-count":1,"title":["Exploring the disjunctive rank of some facet-inducing inequalities of the acyclic coloring polytope"],"prefix":"10.1051","volume":"50","author":[{"given":"M\u00f3nica","family":"Braga","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Marenco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"R1","unstructured":"N. Aguilera, S. Bianchi and G. Nasini, Relaciones entre los rangos de las facetas de problemas asociados a matching.Proc. of the XVIII JAIIO(1999) 10\u201321."},{"key":"R2","doi-asserted-by":"crossref","unstructured":"Alon N., McDiarmid C. and Reed B., Acyclic colouring of graphs.Random Struct. and Algorithms2(1991) 277\u2013288.","DOI":"10.1002\/rsa.3240020303"},{"key":"R3","unstructured":"Au Y. and Tun\u00e7el L., On the polyhedral lift-and-project methods and the fractional stable set polytope.Discrete Optim.6(2009) 206\u2013213."},{"key":"R4","unstructured":"Y. Au and L. Tun\u00e7el, A comprehensive analysis of polyhedral lift-and-project methods. Manuscript (2013)."},{"key":"R5","unstructured":"Balas E., Ceria S. and Cornu\u00e9jols G., Lift-and-Project Cutting Plane Algorithm for Mixed 0 - 1 Programs.Math. Program.58(1993) 295\u2013324."},{"key":"R6","unstructured":"Borodin O.V., On acyclic colorings of planar graphs.Discrete Math.25(1979) 211\u2013236."},{"key":"R7","doi-asserted-by":"crossref","unstructured":"Borodin O.V., Kostochka A.V. and Woodall D.R., Acyclic colourings of planar graphs with large girth.J. London Math. Soc.2(1999) 344-352.","DOI":"10.1112\/S0024610799007942"},{"key":"R8","unstructured":"Borodin O.V., Kostochka A.V., Raspaud A. and Sopena E., Acyclic colouring of 1-planar graphs.Discrete Appl. Math.114(2001) 29\u201341."},{"key":"R9","unstructured":"Braga M. and Marenco J., Disjunctive ranks and anti-ranks of some facet-inducing inequalities of the acyclic coloring polytope.Electron. Notes Discrete Math.37(2011) 213\u2013218."},{"key":"R10","unstructured":"Braga M., Delle Donne D. and Marenco J., A polyhedral study of the acyclic coloring problem.Discrete Appl. Math.160(2012) 2606\u20132617."},{"key":"R11","unstructured":"Burnstein M.I., Every 4-valent graph has an acyclic 5-coloring.Soobsc Akad. Nauk Gruzin SSR93(1979) 21\u201324."},{"key":"R12","unstructured":"Coleman T.F. and Cai J., The cyclic coloring problem and estimation of sparse Hessian matrices.SIAM J. Alg. Disc. Meth.7(1986) 221\u2013235."},{"key":"R13","unstructured":"Coleman T.F. and More J.J., Estimation of sparse Jacobian matrices and graph coloring problems.SIAM J. Numer. Anal.20(1983) 187\u2013209."},{"key":"R14","unstructured":"Fertin G. and Raspaud A., Acyclic Coloring of Graphs of Maximum Degree Five: Nine Colors are Enough.Inf. Process. Lett.105(2008) 65\u201372."},{"key":"R15","unstructured":"Gebremedhin A.H., Manne F. and Pothen A.. What color is your Jacobian? Graph coloring for computing derivatives.SIAM Rev.47(2005) 629\u2013705."},{"key":"R16","unstructured":"Gebremedhin A.H., Tarafdar A., Manne F. and Pothen A., New Acyclic and Star Coloring Algorithms with Application to Computing Hessians.SIAM J. Sci. Comput.29(2007) 1042\u20131072."},{"key":"R17","unstructured":"Gebremedhin A.H., Tarafdar A., Pothen A. and Walther A., Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation.INFORMS J. Comput.21(2009) 209\u2013223."},{"key":"R18","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnbaum B., Acylic colorings of planar graphs.Israel J. Math.14(1973) 390-408.","DOI":"10.1007\/BF02764716"},{"key":"R19","doi-asserted-by":"crossref","unstructured":"J. Lasserre, An explicit exact SDP relaxation for nonlinear 0-1 programs. Vol. 2081 ofLect. Notes Comput. Sci.(2001) 293\u2013303.","DOI":"10.1007\/3-540-45535-3_23"},{"key":"R20","unstructured":"Laurent M., A comparison of the Sherali-Adams, Lov\u00e1sz-Schrijver, and Lasserre relaxations for 0-1 programming.Math. Oper. Res.28(2003) 470\u2013496."},{"key":"R21","unstructured":"Leoni V. and Nasini G., On the relationship between disjunctive relaxations and minors in packing and covering problems.Revista de la Uni\u00f3n Matem\u00e1tica Argentina46(2005) 11\u201322."},{"key":"R22","unstructured":"I. Loiseau, I. M\u00e9ndez D\u00edaz and G. Nasini, Determinaci\u00f3n del rango disyuntivo de facetas del problema de ordenaci\u00f3n lineal.Proc. of the XXII JAIIO(1993) 124\u2013130."},{"key":"R23","unstructured":"Lov\u00e1sz L. and Schrijver A., Cones of matrices and set-functions and 0-1 optimization.SIAM J. Optim.1(1991) 166\u2013190."},{"key":"R24","doi-asserted-by":"crossref","unstructured":"C. Mathieu and A. Sinclair, Sherali-Adams relaxations of the matching polytope.Proc. of STOC\u201909(2009) 293\u2013302.","DOI":"10.1145\/1536414.1536456"},{"key":"R25","unstructured":"I. M\u00e9ndez D\u00edaz and G. Nasini, El problema del ordenamiento lineal y el operador BCC.Proc. of the XVIII JAIIO(1999) 22\u201332."},{"key":"R26","unstructured":"T. Rothvo\u00df, The Lasserre hierarchy in approximation algorithms. MAPSP 2013 tutorial (2013)."},{"key":"R27","unstructured":"Sherali H. and Adams W., A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems.SIAM J. Discrete Math.3(1990) 411\u2013430."}],"container-title":["RAIRO - Operations Research"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015053\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,1]],"date-time":"2019-09-01T14:07:26Z","timestamp":1567346846000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ro.org\/10.1051\/ro\/2015053"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":27,"journal-issue":{"issue":"3"},"alternative-id":["ro150053-s"],"URL":"https:\/\/doi.org\/10.1051\/ro\/2015053","relation":{},"ISSN":["0399-0559","1290-3868"],"issn-type":[{"value":"0399-0559","type":"print"},{"value":"1290-3868","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7]]}}}