Pages that link to "Item:Q1919854"
From MaRDI portal
The following pages link to Genetic and hybrid algorithms for graph coloring (Q1919854):
Displayed 50 items.
- 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)
- Hybrid evolutionary algorithm for the b-chromatic number (Q525060) (← links)
- Bounding the optimum for the problem of scheduling the photographs of an agile Earth observing satellite (Q711387) (← links)
- Improving the extraction and expansion method for large graph coloring (Q714028) (← links)
- Computing the metric dimension of graphs by genetic algorithms (Q849088) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- Tabu search for covering arrays using permutation vectors (Q953845) (← links)
- Variable space search for graph coloring (Q955321) (← links)
- Computing minimal doubly resolving sets of graphs (Q1013386) (← 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)
- What is my objective function? (Q1278819) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- A framework for the description of evolutionary algorithms (Q1584807) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Hybrid evolutionary search for the minimum sum coloring problem of graphs (Q1615675) (← links)
- Programming for modular reconfigurable robots (Q1758696) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Efficient solutions for the far from most string problem (Q1761847) (← links)
- Coloring large graphs based on independent set extraction (Q1761974) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Embedding a sequential procedure within an evolutionary algorithm for coloring problems in graphs (Q1922632) (← links)
- A new ant colony optimization algorithm for the lower bound of sum coloring problem (Q1951174) (← links)
- Decomposition of realizable fuzzy relations (Q1955454) (← links)
- Graph 3-coloring with a hybrid self-adaptive evolutionary algorithm (Q2377173) (← links)
- The dynamic frequency assignment problem (Q2378376) (← links)
- Simple decentralized graph coloring (Q2397096) (← links)
- A Birnbaum-importance based genetic local search algorithm for component assignment problems (Q2449396) (← links)
- The general \(\alpha \)-decomposition problem of fuzzy relations (Q2456464) (← links)
- A graph coloring heuristic using partial solutions and a reactive tabu scheme (Q2456655) (← links)
- CHECKCOL: improved local search for graph coloring (Q2458929) (← links)
- A semidefinite programming-based heuristic for graph coloring (Q2467349) (← links)
- An ant-based algorithm for coloring graphs (Q2467354) (← links)
- Coloring graphs by iterated local search traversing feasible and infeasible solutions (Q2467355) (← links)
- Efficient algorithms for finding critical subgraphs (Q2467361) (← 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)
- The resolution complexity of random graph \(k\)-colorability (Q2581545) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A variable neighborhood search method for solving the traveling tournaments problem (Q2631249) (← 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)