Pages that link to "Item:Q1043356"

The following pages link to A memetic algorithm for graph coloring (Q1043356):

Displaying 28 items.

• An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
• A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
• An exact algorithm with learning for the graph coloring problem (Q337154) (← links)
• Tabu search for the cyclic bandwidth problem (Q337475) (← links)
• Memetic search for the max-bisection problem (Q339560) (← links)
• Quantum annealing of the graph coloring problem (Q429697) (← links)
• Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
• A hybrid metaheuristic approach to solving the UBQP problem (Q613436) (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
• Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
• Optimization by ant algorithms: possible roles for an individual ant (Q1758036) (← links)
• A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• Uncertain vertex coloring problem (Q2001167) (← links)
• An incremental search heuristic for coloring vertices of a graph (Q2056884) (← links)
• Grouping products for the optimization of production processes: a case in the steel manufacturing industry (Q2184105) (← links)
• A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem (Q2195439) (← links)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• The freight consolidation and containerization problem (Q2256168) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
• INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
• Graph Coloring Models and Metaheuristics for Packing Applications (Q4634984) (← links)
• Dual-neighborhood iterated local search for routing and wavelength assignment (Q6068726) (← links)
• A massively parallel evolutionary algorithm for the partial Latin square extension problem (Q6106593) (← links)
• A fast tri-individual memetic search approach for the distance-based critical node problem (Q6167524) (← links)