An exact approach for the vertex coloring problem
From MaRDI portal
(Redirected from Publication:429677)
Recommendations
- A metaheuristic approach for the vertex coloring problem
- An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
- A survey on vertex coloring problems
- Exact solution of graph coloring problems via constraint programming and column generation
- Exact weighted vertex coloring via branch-and-price
Cites work
- scientific article; zbMATH DE number 6118217 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1786225 (Why is no real title available?)
- scientific article; zbMATH DE number 956854 (Why is no real title available?)
- scientific article; zbMATH DE number 956855 (Why is no real title available?)
- scientific article; zbMATH DE number 3050594 (Why is no real title available?)
- A Column Generation Approach for Graph Coloring
- A Heuristic Method for the Set Covering Problem
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
- A branch-and-cut algorithm for graph coloring
- A cutting plane algorithm for graph coloring
- A graph coloring algorithm for large scheduling problems
- A graph coloring heuristic using partial solutions and a reactive tabu scheme
- A metaheuristic approach for the vertex coloring problem
- A survey on vertex coloring problems
- An adaptive memory algorithm for the \(k\)-coloring problem
- An introduction to timetabling
- Ant local search and its efficient adaptation to graph colouring
- Chromatic Scheduling and the Chromatic Number Problem
- Finding the chromatic number by means of critical graphs
- Graph colouring approaches for a satellite range scheduling problem
- Hybrid evolutionary algorithms for graph coloring
- New methods to color the vertices of a graph
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
- Simple ingredients leading to very efficient heuristics for the maximum clique problem
- Using extra dual cuts to accelerate column generation
- Using tabu search techniques for graph coloring
Cited in
(62)- The maximum-impact coloring polytope
- Solving the list coloring problem through a branch-and-price algorithm
- Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems
- A memetic algorithm with adaptive operator selection for graph coloring
- The vertex coloring problem and its generalizations
- The minimum chromatic violation problem: a polyhedral approach
- Solving vertex coloring problems as maximum weight stable set problems
- A Wide Branching Strategy for the Graph Coloring Problem
- A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques
- scientific article; zbMATH DE number 6697958 (Why is no real title available?)
- Graph coloring lower bounds from decision diagrams
- A new branch-and-bound algorithm for the maximum weighted clique problem
- Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams
- An integer programming approach to b-coloring
- Graph coloring with decision diagrams
- Bin packing problem with conflicts and item fragmentation
- An exact method for graph coloring
- Exact solution of graph coloring problems via constraint programming and column generation
- A survey on vertex coloring problems
- A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations
- Adaptive solution prediction for combinatorial optimization
- Vehicle sequencing at transshipment terminals with handover relations
- A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
- An unconstrained quadratic binary programming approach to the vertex coloring problem
- An improved DSATUR-based branch-and-bound algorithm for the vertex coloring problem
- Symmetry-breaking inequalities for ILP with structured sub-symmetry
- An exact algorithm for the partition coloring problem
- Dual inequalities for stabilized column generation revisited
- Linear programming formulation of the vertex colouring problem
- Combining lithography and directed self assembly for the manufacturing of vias: connections to graph coloring problems, integer programming formulations, and numerical experiments
- A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems
- Minimum sum coloring problem: upper bounds for the chromatic strength
- On the asymmetric representatives formulation for the vertex coloring problem
- A branch-and-cut algorithm for the edge interdiction clique problem
- Exact approaches for the orderly colored longest path problem: performance comparison
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning
- Safe lower bounds for graph coloring
- An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
- Simple decentralized graph coloring
- A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
- Vertex coloring of a graph for memory constrained scenarios
- Graph coloring-based approach for railway station design analysis and capacity determination
- Projective cutting-planes
- A branch and price algorithm for list coloring problem
- A metaheuristic approach for the vertex coloring problem
- Branch-and-cut-and-price algorithms for the preemptive RCPSP
- Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks
- Lower bounding techniques for DSATUR-based branch and bound
- Exact algorithms for a discrete metric labeling problem
- A branch-and-price algorithm for the minimum sum coloring problem
- Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach
- Exact weighted vertex coloring via branch-and-price
- An exact algorithm with learning for the graph coloring problem
- New integer linear programming models for the vertex coloring problem
- Maximum-weight stable sets and safe lower bounds for graph coloring
- Constraint and satisfiability reasoning for graph coloring
- A polyhedral study of the maximum stable set problem with weights on vertex-subsets
- Total coloring and total matching: polyhedra and facets
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- A branch-and-price algorithm for the (\(k,c\))-coloring problem
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A simple branching scheme for vertex coloring problems
This page was built for publication: An exact approach for the vertex coloring problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q429677)
