Facets of the graph coloring polytope
From MaRDI portal
Publication:1854776
DOI10.1023/A:1021315911306zbMath1013.90097OpenAlexW181266127MaRDI QIDQ1854776
Javier Marenco, Pablo Coll, Paula Zabala, Isabel Méndez-Díaz
Publication date: 27 January 2003
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1021315911306
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Coloring of graphs and hypergraphs (05C15)
Related Items
A polyhedral investigation of star colorings, An exact algorithm for the edge coloring by total labeling problem, Facet-inducing web and antiweb inequalities for the graph coloring polytope, A supernodal formulation of vertex colouring with applications in course timetabling, An integer programming approach to b-coloring, Derivations of large classes of facet defining inequalities of the weak order polytope using ranking structures, Symmetry-breaking inequalities for ILP with structured sub-symmetry, The maximum-impact coloring polytope, Packing and partitioning orbitopes, Polyhedral studies of vertex coloring problems: the standard formulation, On the asymmetric representatives formulation for the vertex coloring problem, A branch-and-cut procedure for the Udine course timetabling problem, A branch-and-cut algorithm for graph coloring, Polyhedral studies for minimum‐span graph labelling with integer distance constraints, A one-to-one correspondence between colorings and stable sets, Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation, Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results, Graph coloring inequalities from all-different systems
