A cutting plane algorithm for graph coloring
From MaRDI portal
Publication:2467348
DOI10.1016/J.DAM.2006.07.010zbMATH Open1163.90012OpenAlexW1970686950MaRDI QIDQ2467348FDOQ2467348
Paula Zabala, Isabel Méndez-Díaz
Publication date: 21 January 2008
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2006.07.010
Graph algorithms (graph-theoretic aspects) (05C85) Integer programming (90C10) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Geometric algorithms and combinatorial optimization
- On the facial structure of set packing polyhedra
- New methods to color the vertices of a graph
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- A Column Generation Approach for Graph Coloring
- A Pruning Procedure for Exact Graph Coloring
- A polyhedral approach for graph coloring
Cited In (38)
- Fractional programming formulation for the vertex coloring problem
- A polyhedral approach for the equitable coloring problem
- A mixed-integer linear programming approach for the t-row and the multi-bay facility layout problem
- Exact solution of graph coloring problems via constraint programming and column generation
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- A polyhedral study of the acyclic coloring problem
- A polyhedral study of the acyclic coloring problem
- Graph coloring with decision diagrams
- Integer programming techniques for the nurse rostering problem
- A polyhedral approach for graph coloring
- An exact approach for the vertex coloring problem
- An integer programming approach to b-coloring
- CsegGraph: a graph colouring instance generator
- A branch and price algorithm for list coloring problem
- Polyhedral studies of vertex coloring problems: the standard formulation
- Ising formulations of some graph-theoretic problems in psychological research: models and methods
- The minimum chromatic violation problem: a polyhedral study
- Preprocessing and cutting planes with conflict graphs
- Improving lower bounds for equitable chromatic number
- Multi-constructor CMSA for the maximum disjoint dominating sets problem
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- A supernodal formulation of vertex colouring with applications in course timetabling
- A branch-and-cut procedure for the Udine course timetabling problem
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- Graph coloring inequalities from all-different systems
- Facets of the graph coloring polytope
- The maximum-impact coloring polytope
- An exact algorithm with learning for the graph coloring problem
- Three new upper bounds on the chromatic number
- A note on computational approaches for the antibandwidth problem
- A cutting plane algorithm for MV portfolio selection model
- Simple decentralized graph coloring
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Integer linear programming formulations of the filter partitioning minimization problem
- The minimum chromatic violation problem: a polyhedral approach
- Polyhedral results for the equitable coloring problem
- Safe Lower Bounds for Graph Coloring
Uses Software
This page was built for publication: A cutting plane algorithm for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467348)
