Pages that link to "Item:Q2901013"

The following pages link to A metaheuristic approach for the vertex coloring problem (Q2901013):

Displaying 49 items.

• A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
• 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)
• Variable space search for graph coloring (Q955321) (← links)
• An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
• The vertex coloring problem and its generalizations (Q1022440) (← links)
• Models and heuristic algorithms for a weighted vertex coloring problem (Q1038841) (← links)
• A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
• A memetic algorithm for graph coloring (Q1043356) (← links)
• A two-level metaheuristic for the all colors shortest path problem (Q1616945) (← links)
• Weighted vertices optimizer (WVO): a novel metaheuristic optimization algorithm (Q1735708) (← 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)
• Coloring large graphs based on independent set extraction (Q1761974) (← links)
• An effective heuristic algorithm for sum coloring of graphs (Q1762148) (← links)
• A new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
• Scheduling algorithm to select optimal programme slots in television channels: a graph theoretic approach (Q1791804) (← links)
• Uncertain vertex coloring problem (Q2001167) (← links)
• A matheuristic approach for the \(b\)-coloring problem using integer programming and a multi-start multi-greedy randomized metaheuristic (Q2239844) (← links)
• Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
• Simple decentralized graph coloring (Q2397096) (← links)
• An exact algorithm for parallel machine scheduling with conflicts (Q2400043) (← links)
• Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
• A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
• An adaptive memory algorithm for the \(k\)-coloring problem (Q2467362) (← 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)
• A systematic study on meta-heuristic approaches for solving the graph coloring problem (Q2664279) (← links)
• Exact and approximate methods for the score-constrained packing problem (Q2672111) (← links)
• A NEW APPROACH TO THE VERTEX COLORING PROBLEM (Q2790363) (← links)
• Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams (Q2806865) (← links)
• Informed reactive tabu search for graph coloring (Q2853412) (← links)
• An extraction and expansion approach for graph coloring (Q2868189) (← links)
• A Wide Branching Strategy for the Graph Coloring Problem (Q2940061) (← links)
• (Q2970217) (← links)
• A survey on vertex coloring problems (Q3002686) (← links)
• A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems (Q3386775) (← links)
• Graph Coloring Models and Metaheuristics for Packing Applications (Q4634984) (← links)
• A heuristic for the minimum cost chromatic partition problem (Q5109809) (← links)
• A Generalized Consistent Neighborhood Search for Satellite Range Scheduling Problems (Q5247673) (← links)
• A metaheuristic framework for nonlinear capacitated covering problems (Q5963698) (← links)
• A massively parallel evolutionary algorithm for the partial Latin square extension problem (Q6106593) (← links)
• Meta-heuristics and artificial intelligence (Q6602249) (← links)