Pages that link to "Item:Q351547"
From MaRDI portal
The following pages link to New heuristics for the vertex coloring problem based on semidefinite programming (Q351547):
Displaying 8 items.
- \(L(3,2,1)\)-labeling of triangular and toroidal grids (Q301947) (← links)
- Semidefinite programming relaxations for graph coloring and maximal clique problems (Q868457) (← links)
- Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
- Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR (Q2051177) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- (Q2970217) (← links)
- New variable neighborhood search method for minimum sum coloring problem on simple graphs (Q3389565) (← links)
- Collective dynamics of phase-repulsive oscillators solves graph coloring problem (Q5112986) (← links)