The following pages link to (Q5687262):
Displaying 31 items.
- An exact approach for the vertex coloring problem (Q429677) (← links)
- Quantum annealing of the graph coloring problem (Q429697) (← links)
- Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- Corrigendum to ``Variable space search for graph coloring'' [Discrete Appl. Math. 156, No.\,13, 2551--2560 (2008; Zbl 1213.05085)] (Q1028098) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- A memetic algorithm for graph coloring (Q1043356) (← links)
- Coloration neighbourhood search with forward checking (Q1601930) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- An immune algorithm with stochastic aging and Kullback entropy for the chromatic number problem (Q2460104) (← links)
- Generalised graph colouring by a hybrid of local search and constraint programming (Q2467347) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Another look at graph coloring via propositional satisfiability (Q2467359) (← links)
- Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
- Exploiting relaxation in local search for LABS (Q2468767) (← links)
- An evolutionary approach for bandwidth multicoloring problems (Q2482742) (← links)
- Embedding a novel objective function in a two-phased local search for robust vertex coloring (Q2482807) (← links)
- An exact method for graph coloring (Q2489282) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- Iterated local search with tabu search for the weighted vertex coloring problem (Q2664440) (← links)
- Very Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems (Q2950521) (← links)
- A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems (Q5247673) (← links)
- SAT-boosted tabu search for coloring massive graphs (Q6579769) (← links)
