Pages that link to "Item:Q2489304"
From MaRDI portal
The following pages link to A survey of local search methods for graph coloring (Q2489304):
Displaying 13 items.
- Informed reactive tabu search for graph coloring (Q2853412) (← links)
- An extraction and expansion approach for graph coloring (Q2868189) (← links)
- A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- A survey on vertex coloring problems (Q3002686) (← links)
- A Tabu Search Heuristic for the Equitable Coloring Problem (Q3195344) (← links)
- Vehicle Sequencing at Transshipment Terminals with Handover Relations (Q4995083) (← links)
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning (Q5084594) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)
- Local search algorithms for the composite retrieval problem (Q6079877) (← links)
- Multi-neighborhood simulated annealing for the minimum interference frequency assignment problem (Q6114925) (← links)
- Expected polynomial-time randomized algorithm for graph coloring problem (Q6558677) (← links)
- A fresh look at a randomized massively parallel graph coloring algorithm (Q6617714) (← links)
