On the asymmetric representatives formulation for the vertex coloring problem
From MaRDI portal
Publication:2482105
DOI10.1016/j.dam.2007.05.058zbMath1138.05020MaRDI QIDQ2482105
Ricardo C. Corrêa, Manoel B. Campêlo, Victor A. Campos
Publication date: 16 April 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2007.05.058
90C10: Integer programming
05C15: Coloring of graphs and hypergraphs
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
A branch‐and‐price approach to k‐clustering minimum biclique completion problem, A branch‐and‐cut algorithm for the ring spur assignment problem, A polyhedral study of the maximum stable set problem with weights on vertex-subsets, Models for a Steiner multi-ring network design problem with revenues, An extended edge-representative formulation for the \(K\)-partitioning problem, Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables, A DSATUR-based algorithm for the equitable coloring problem, Fractional programming formulation for the vertex coloring problem, Solving vertex coloring problems as maximum weight stable set problems, A column generation based algorithm for the robust graph coloring problem, Facet-inducing web and antiweb inequalities for the graph coloring polytope, A supernodal formulation of vertex colouring with applications in course timetabling, A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem, Integer linear programming formulations of the filter partitioning minimization problem, An exact algorithm for the partition coloring problem, Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs, Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope, General cut-generating procedures for the stable set polytope, Finding the root graph through minimum edge deletion, The minimum chromatic violation problem: a polyhedral approach, Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments, Memetic collaborative approaches for finding balanced incomplete block designs, The minimum chromatic violation problem: a polyhedral study, A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph, An integer programming approach to b-coloring, A polyhedral approach for the equitable coloring problem, Chromatic Gallai identities operating on Lovász number, Polyhedral results for the Equitable Coloring Problem, A Combined Parallel Lagrangian Decomposition and Cutting-Plane Generation for Maximum Stable Set Problems, The maximum-impact coloring polytope, A survey on vertex coloring problems
Cites Work
