Pages that link to "Item:Q2467349"
From MaRDI portal
The following pages link to A semidefinite programming-based heuristic for graph coloring (Q2467349):
Displaying 15 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Graph coloring: a novel heuristic based on trailing path-properties, perspective and applications in structured networks (Q780266) (← links)
- Copositive programming motivated bounds on the stability and the chromatic numbers (Q847835) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- An optimal greedy heuristic to color interval graphs (Q922724) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- Solving graph coloring problems with the Douglas-Rachford algorithm (Q1653324) (← links)
- Improving graph colouring algorithms and heuristics using a novel representation (Q1742608) (← links)
- Approximating maximum stable set and minimum graph coloring problems with the positive semidefinite relaxation (Q2760093) (← links)
- A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- (Q3035310) (← links)
- Robust graph coloring based on the matrix semi-tensor product with application to examination timetabling (Q5497725) (← links)
- Evolutionary Computation in Combinatorial Optimization (Q5706004) (← links)