A cutting plane algorithm for graph coloring
From MaRDI portal
(Redirected from Publication:2467348)
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3571502 (Why is no real title available?)
- scientific article; zbMATH DE number 1312984 (Why is no real title available?)
- scientific article; zbMATH DE number 956855 (Why is no real title available?)
- A Column Generation Approach for Graph Coloring
- A Pruning Procedure for Exact Graph Coloring
- A polyhedral approach for graph coloring
- Geometric algorithms and combinatorial optimization
- New methods to color the vertices of a graph
- On the facial structure of set packing polyhedra
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
Cited in
(44)- 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 branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- Solving a multicoloring problem with overlaps using integer programming
- Graph coloring with decision diagrams
- A polyhedral study of the acyclic coloring problem
- A polyhedral study of the acyclic coloring problem
- Integer programming techniques for the nurse rostering problem
- An exact approach for the vertex coloring problem
- A polyhedral approach for graph coloring
- Facet-generating procedures for the maximum-impact coloring polytope
- An integer programming approach to b-coloring
- A branch and price algorithm for list coloring problem
- The maximum k-colorable subgraph problem and orbitopes
- CsegGraph: a graph colouring instance generator
- 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
- Branch-cut-and-propagate for the maximum \(k\)-colorable subgraph problem with symmetry
- 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
- Safe lower bounds for graph coloring
- A branch-and-cut algorithm 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
- A new approach to the vertex coloring problem
- Facet-inducing inequalities and a cut-and-branch for the bandwidth coloring polytope based on the orientation model
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)
