Pages that link to "Item:Q581241"
From MaRDI portal
The following pages link to Some experiments with simulated annealing for coloring graphs (Q581241):
Displayed 27 items.
- Using tabu search techniques for graph coloring (Q580987) (← links)
- Simulated annealing: A tool for operational research (Q913662) (← links)
- Methods for the one-dimensional space allocation problem (Q916571) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- Tabu search techniques. A tutorial and an application to neural networks (Q1120479) (← links)
- COSINE: A new graph coloring algorithm (Q1180823) (← links)
- STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136) (← links)
- An SA/TS mixture algorithm for the scheduling tardiness problem (Q1266621) (← links)
- General local search methods (Q1268283) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- Local optima topology for the \(k\)-coloring problem (Q1327233) (← links)
- A robust simulated annealing based examination timetabling system. (Q1406667) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- An information-based neural approach to generic constraint satisfaction. (Q1852859) (← links)
- Variants of simulated annealing for the examination timetabling problem (Q1919836) (← links)
- Genetic and hybrid algorithms for graph coloring (Q1919854) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← links)
- An improved ant colony optimisation heuristic for graph colouring (Q2473031) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- On the chromatic number of graphs (Q5942344) (← links)