A branch-and-cut algorithm for graph coloring
From MaRDI portal
Publication:2489906
Recommendations
Cites work
- scientific article; zbMATH DE number 53191 (Why is no real title available?)
- 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 821271 (Why is no real title available?)
- scientific article; zbMATH DE number 956839 (Why is no real title available?)
- scientific article; zbMATH DE number 956840 (Why is no real title available?)
- scientific article; zbMATH DE number 956852 (Why is no real title available?)
- scientific article; zbMATH DE number 956855 (Why is no real title available?)
- scientific article; zbMATH DE number 4187836 (Why is no real title available?)
- A Column Generation Approach for Graph Coloring
- A Pruning Procedure for Exact Graph Coloring
- A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
- A graph coloring algorithm for large scheduling problems
- A polyhedral approach for graph coloring
- An exact algorithm for the maximum stable set problem
- Facets of the graph coloring polytope
- Frozen development in graph coloring
- New methods to color the vertices of a graph
- On the facial structure of set packing polyhedra
- On the facial structure of the set covering polytope
- On the solution of traveling salesman problems
- The ABACUS system for branch-and-cut-and-price algorithms in integer programming and combinatorial optimization
- Using tabu search techniques for graph coloring
Cited in
(70)- A Pruning Procedure for Exact Graph Coloring
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems
- A one-to-one correspondence between colorings and stable sets
- Fractional programming formulation for the vertex coloring problem
- Coloring graphs by iterated local search traversing feasible and infeasible solutions
- An exact method for graph coloring
- Exact solution of graph coloring problems via constraint programming and column generation
- A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
- A folding preprocess for the max k-cut problem
- A Wide Branching Strategy for the Graph Coloring Problem
- Solving a multicoloring problem with overlaps using integer programming
- A simple branching scheme for vertex coloring problems
- An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
- Lower bounds for the minimal sum coloring problem
- Graph coloring with decision diagrams
- A polyhedral study of the acyclic coloring problem
- A polyhedral study of the acyclic coloring problem
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- A polyhedral investigation of star colorings
- Dual inequalities for stabilized column generation revisited
- An exact approach for the vertex coloring problem
- A polyhedral approach for graph coloring
- Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring
- Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
- Solving the list coloring problem through a branch-and-price algorithm
- An integer programming approach to b-coloring
- 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
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Packing and partitioning orbitopes
- The minimum chromatic violation problem: a polyhedral study
- Solving vertex coloring problems as maximum weight stable set problems
- Orbital branching
- Solving graph coloring problems with the Douglas-Rachford algorithm
- A branch-and-cut algorithm for the connected max-k-cut problem
- scientific article; zbMATH DE number 4144006 (Why is no real title available?)
- 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
- Facets of the graph coloring polytope
- Heuristic and exact algorithms for a min-max selective vehicle routing problem
- The maximum-impact coloring polytope
- An exact algorithm with learning for the graph coloring problem
- A DSATUR-based algorithm for the equitable coloring problem
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- Integer programming in psychology: a review and directions for future research
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Total coloring and total matching: polyhedra and facets
- A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
- A note on computational approaches for the antibandwidth problem
- Discrete optimization methods to fit piecewise affine models to data points
- Variable space search for graph coloring
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- Embedding a novel objective function in a two-phased local search for robust vertex coloring
- Maximum-weight stable sets and safe lower bounds for graph coloring
- A branch-and-cut algorithm for partition coloring
- Safe lower bounds for graph coloring
- A cutting plane algorithm for graph coloring
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
- Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz
- The minimum chromatic violation problem: a polyhedral approach
- A polyhedral study of a relaxation of the routing and spectrum allocation problem
- Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches
- A column generation based algorithm for the robust graph coloring problem
- Compact formulations and valid inequalities for parallel machine scheduling with conflicts
- Three algorithms for graph locally harmonious colouring
- The minimum quasi-clique partitioning problem: complexity, formulations, and a computational study
This page was built for publication: A branch-and-cut algorithm for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2489906)
