A semidefinite programming-based heuristic for graph coloring
From MaRDI portal
(Redirected from Publication:2467349)
Recommendations
- Approximate graph coloring by semidefinite programming
- New heuristics for the vertex coloring problem based on semidefinite programming
- scientific article; zbMATH DE number 4187836
- scientific article; zbMATH DE number 4134072
- Publication:4206748
- A heuristic for the convex recoloring problem in graphs
- scientific article; zbMATH DE number 2119717
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- scientific article; zbMATH DE number 4210190
Cites work
- scientific article; zbMATH DE number 3639144 (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 Spectral Bundle Method for Semidefinite Programming
- A boundary point method to solve semidefinite programs
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- Approximate graph coloring by semidefinite programming
- Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation
- Chromatic Scheduling and the Chromatic Number Problem
- Finding the chromatic number by means of critical graphs
- Genetic algorithm for graph coloring: exploration of Galinier and Hao's algorithm
- Genetic and hybrid algorithms for graph coloring
- Hybrid evolutionary algorithms for graph coloring
- New methods to color the vertices of a graph
- On approximate graph colouring and MAX-k-CUT algorithms based on the -function
- On the Shannon capacity of a graph
- Semidefinite optimization
- Semidefinite programming in combinatorial optimization
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- Solving some large scale semidefinite programs via the conjugate residual method
- Strengthening the Lovász \(\theta(\overline G)\) bound for graph coloring
- Using tabu search techniques for graph coloring
Cited in
(22)- Dealing with inequality constraints in large-scale semidefinite relaxations for graph coloring and maximum clique problems
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling
- A Wide Branching Strategy for the Graph Coloring Problem
- Evolutionary Computation in Combinatorial Optimization
- A parallel lagrangian heuristic for the fractional chromatic number of a graph
- scientific article; zbMATH DE number 4091188 (Why is no real title available?)
- A search space ``cartography for guiding graph coloring heuristics
- New heuristics for the vertex coloring problem based on semidefinite programming
- Copositive programming motivated bounds on the stability and the chromatic numbers
- Solving graph coloring problems with the Douglas-Rachford algorithm
- Graph coloring and semidefinite rank
- Semidefinite programming relaxations for graph coloring and maximal clique problems
- scientific article; zbMATH DE number 2119717 (Why is no real title available?)
- Models and heuristic algorithms for a weighted vertex coloring problem
- Graph coloring and semidefinite rank
- An optimal greedy heuristic to color interval graphs
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks
- A new approach to the vertex coloring problem
- Improving graph colouring algorithms and heuristics using a novel representation
- Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation
- The Operator \Psi for the Chromatic Number of a Graph
- scientific article; zbMATH DE number 4134072 (Why is no real title available?)
This page was built for publication: A semidefinite programming-based heuristic for graph coloring
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467349)
