Pages that link to "Item:Q1970334"
From MaRDI portal
The following pages link to Hybrid evolutionary algorithms for graph coloring (Q1970334):
Displaying 50 items.
- Analysing the effects of solution space connectivity with an effective metaheuristic for the course timetabling problem (Q300032) (← links)
- A three-phased local search approach for the clique partitioning problem (Q306093) (← links)
- A memetic algorithm for the minimum sum coloring problem (Q336939) (← links)
- Towards objective measures of algorithm performance across instance space (Q336954) (← links)
- A study of hybrid evolutionary algorithms for single machine scheduling problem with sequence-dependent setup times (Q337074) (← links)
- Memetic search for the max-bisection problem (Q339560) (← links)
- An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
- Exploring the role of graph spectra in graph coloring algorithm performance (Q403572) (← links)
- Genetic tabu search for robust fixed channel assignment under dynamic traffic data (Q409273) (← 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 particle swarm optimizer for grouping problems (Q497654) (← links)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- When a genetic algorithm outperforms hill-climbing (Q596132) (← links)
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- Consistent neighborhood search for combinatorial optimization (Q693704) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- An efficient memetic algorithm for the graph partitioning problem (Q763098) (← links)
- An unconstrained quadratic binary programming approach to the vertex coloring problem (Q817187) (← links)
- Graph colouring approaches for a satellite range scheduling problem (Q835607) (← links)
- Breaking the search space symmetry in partitioning problems: an application to the graph coloring problem (Q884452) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- About equivalent interval colorings of weighted graphs (Q967426) (← 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)
- Two heuristics for the one-dimensional bin-packing problem (Q1018262) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- Graph coloring by multiagent fusion search (Q1037448) (← 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)
- Guidelines for the use of meta-heuristics in combinatorial optimization. (Q1410607) (← links)
- Genetic local search with distance preserving recombination operator for a vehicle routing problem. (Q1410618) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- Heuristic search to the capacitated clustering problem (Q1622798) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← 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 new \textsf{DSATUR}-based algorithm for exact vertex coloring (Q1762162) (← links)
- On integrating an iterated variable neighborhood search within a bi-objective genetic algorithm: sum coloring of graphs case application (Q1791912) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- Decomposition of realizable fuzzy relations (Q1955454) (← links)
- Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
- Adaptive feasible and infeasible tabu search for weighted vertex coloring (Q2200563) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- Multi-coloring and job-scheduling with assignment and incompatibility costs (Q2449346) (← links)
