Pages that link to "Item:Q581241"

The following pages link to Some experiments with simulated annealing for coloring graphs (Q581241):

Displaying 45 items.

• Heuristics for a project management problem with incompatibility and assignment costs (Q429511) (← links)
• Quantum annealing of the graph coloring problem (Q429697) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• Using tabu search techniques for graph coloring (Q580987) (← links)
• Hybrid pattern search and simulated annealing for fuzzy production planning problems (Q611416) (← links)
• Improving the extraction and expansion method for large graph coloring (Q714028) (← 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)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
• A general-purpose hill-climbing method for order independent minimum grouping problems: A case study in graph colouring and bin packing (Q1013410) (← links)
• Combinatorial optimization in system configuration design (Q1027725) (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
• On a parallel genetic-tabu search based algorithm for solving the graph colouring problem (Q1042037) (← links)
• A memetic algorithm for graph coloring (Q1043356) (← 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)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Coloring large graphs based on independent set extraction (Q1761974) (← 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)
• An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
• On the use of some known methods for \(T\)-colorings of graphs (Q2367012) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Simple decentralized graph coloring (Q2397096) (← 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)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
• AN EXTRACTION AND EXPANSION APPROACH FOR GRAPH COLORING (Q2868189) (← links)