{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:44:30Z","timestamp":1759063470889,"version":"3.40.5"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1023\/a:1021315911306","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T01:22:32Z","timestamp":1048209752000},"page":"79-90","source":"Crossref","is-referenced-by-count":29,"title":["Facets of the Graph Coloring Polytope"],"prefix":"10.1007","volume":"116","author":[{"given":"Pablo","family":"Coll","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Javier","family":"Marenco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"M\u00e9ndez D\u00edaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paula","family":"Zabala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5101678_CR1","unstructured":"K. Aardal, A. Hipolito, C. van Hoesel, B. Jansen, C. Roos and T. Terlaky, A branch-and-cut algorithm for the frequency assignment problem, Research Memorandum 96\/011, Maastricht University (1996)."},{"key":"5101678_CR2","doi-asserted-by":"crossref","unstructured":"E. Balas, S. Ceria, G. Cornu\u00e9jols and G. Pataki, Polyhedral methods for the maximum clique problem, in: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D. Johnson and M. Trick (1996) pp. 11-27.","DOI":"10.1090\/dimacs\/026\/02"},{"key":"5101678_CR3","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D. Br\u00e9laz","year":"1979","unstructured":"D. Br\u00e9laz, New methods to color the vertices of a graph, Communications of the ACM 22 (1979) 251-256.","journal-title":"Communications of the ACM"},{"key":"5101678_CR4","unstructured":"T. Christof, A. Loebel and M. Stoer, PORTA-a polyhedron representation transformation algorithm, Version 1.3 (1997)."},{"key":"5101678_CR5","first-page":"191","volume":"Suppl.7","author":"D. de Werra","year":"1990","unstructured":"D. de Werra, Heuristics for graph coloring, Computing, Suppl. 7 (1990) 191-208.","journal-title":"Computing"},{"key":"5101678_CR6","doi-asserted-by":"crossref","unstructured":"F. Glover, M. Parker and J. Ryan, Coloring by tabu branch and bound, in: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D. Johnson and M. Trick (1996) pp. 285-308.","DOI":"10.1090\/dimacs\/026\/14"},{"key":"5101678_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Grotschel","year":"1988","unstructured":"M. Grotschel, L. Lovasz and A. Schrijver, Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"5101678_CR8","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02239976","volume":"39","author":"A. Herz","year":"1987","unstructured":"A. Herz and D. de Werra, Using tabu search techniques for graph coloring, Computing 39 (1987) 345-351.","journal-title":"Computing"},{"key":"5101678_CR9","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1016\/0196-6774(85)90012-4","volume":"6","author":"D. Johnson","year":"1985","unstructured":"D. Johnson, The NP-completeness column: An ongoing guide, Journal of Algorithms 6 (1985) 434-451.","journal-title":"Journal of Algorithms"},{"key":"5101678_CR10","doi-asserted-by":"crossref","unstructured":"D. Johnson and M. Trick, (eds.), Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26 (1996).","DOI":"10.1090\/dimacs\/026"},{"key":"5101678_CR11","doi-asserted-by":"crossref","unstructured":"R. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations, eds. R. Miller and J. Thatcher (1972) pp. 85-104.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"issue":"4","key":"5101678_CR12","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1145\/3341.3350","volume":"28","author":"M. Kubale","year":"1985","unstructured":"M. Kubale and B. Jackowski, A generalized implicit enumeration algorithm for graph coloring, Communications of the ACM 28(4) (1985) 412-418.","journal-title":"Communications of the ACM"},{"key":"5101678_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/BF01299447","volume":"3","author":"C. Mannino","year":"1994","unstructured":"C. Mannino and A. Sassano, An exact algorithm for the maximum estable set problem, Computational Optimization and Applications 3 (1994) 243-258.","journal-title":"Computational Optimization and Applications"},{"issue":"4","key":"5101678_CR14","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A. Mehrotra","year":"1996","unstructured":"A. Mehrotra and M. Trick, A column generation approach for graph coloring, INFORMS Journal on Computing 8(4) (1996) 344-353.","journal-title":"INFORMS Journal on Computing"},{"key":"5101678_CR15","doi-asserted-by":"crossref","unstructured":"G. Nemhauser and G. Sigismondi, A strong cutting plane\/branch-and-bound algorithm for node packing, Journal of Operations Research Society 43(5) (1992) 443-457.","DOI":"10.1057\/palgrave.jors.0430507"},{"key":"5101678_CR16","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G. Nemhauser","year":"1988","unstructured":"G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"5101678_CR17","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF01580121","volume":"5","author":"M.W. Padberg","year":"1973","unstructured":"M.W. Padberg, On the facial structure of Set Packing Polyhedral, Mathematical Programming 5 (1973) 199-215.","journal-title":"Mathematical Programming"},{"issue":"3","key":"5101678_CR18","doi-asserted-by":"crossref","first-page":"226","DOI":"10.1287\/ijoc.3.3.226","volume":"3","author":"T.J. Sager","year":"1991","unstructured":"T.J. Sager and S. Lin, A pruning procedure for exact graph coloring, ORSA Journal on Computing 3(3) (1991) 226-230.","journal-title":"ORSA Journal on Computing"},{"key":"5101678_CR19","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/BF01587087","volume":"44","author":"A. Sassano","year":"1989","unstructured":"A. Sassano, On the facial structure of the Set Covering Polytope, Mathematical Programming 44 (1989) 181-202.","journal-title":"Mathematical Programming"},{"key":"5101678_CR20","doi-asserted-by":"crossref","unstructured":"E. Sewell, An improved algorithm for exact graph coloring, in: Cliques, Coloring, and Satisfiability, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, Vol. 26, eds. D. Johnson and M. Trick (1996) pp. 359-373.","DOI":"10.1090\/dimacs\/026\/17"},{"key":"5101678_CR21","volume-title":"Integer Programming","author":"L. Wolsey","year":"1998","unstructured":"L. Wolsey, Integer Programming (Wiley, New York, 1998)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021315911306.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021315911306\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021315911306.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:09:19Z","timestamp":1747577359000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021315911306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":21,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["5101678"],"URL":"https:\/\/doi.org\/10.1023\/a:1021315911306","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}