Pages that link to "Item:Q2467362"

The following pages link to An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362):

Displaying 32 items.

• An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
• Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
• An exact approach for the vertex coloring problem (Q429677) (← links)
• Quantum annealing of the graph coloring problem (Q429697) (← links)
• A matrix approach to graph maximum stable set and coloring problems with application to multi-agent systems (Q445938) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← 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)
• 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)
• Graph coloring by multiagent fusion search (Q1037448) (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
• A memetic algorithm for graph coloring (Q1043356) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Coloring large graphs based on independent set extraction (Q1761974) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← links)
• A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
• Efficient algorithms for finding critical subgraphs (Q2467361) (← links)
• A survey of local search methods for graph coloring (Q2489304) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
• Informed reactive tabu search for graph coloring (Q2853412) (← links)
• An extraction and expansion approach for graph coloring (Q2868189) (← links)
• Metaheuristics for truck loading in the car production industry (Q2968504) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• CsegGraph: a graph colouring instance generator (Q3643182) (← links)
• Graph Coloring Models and Metaheuristics for Packing Applications (Q4634984) (← links)
• A parallel adaptive memory algorithm for the capacitated modular hub location problem (Q6164373) (← links)
• Meta-heuristics and artificial intelligence (Q6602249) (← links)