Pages that link to "Item:Q1262136"
From MaRDI portal
The following pages link to STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136):
Displayed 24 items.
- TABARIS: An exact algorithm based on tabu search for finding a maximum independent set in a graph (Q750320) (← links)
- A cooperative search method for the \(k\)-coloring problem (Q928692) (← links)
- The life span method -- a new variant of local search (Q1275844) (← links)
- An efficient tabu search procedure for the \(p\)-median problem (Q1278496) (← links)
- Constructing a course schedule by solving a series of assignment type problems (Q1296794) (← links)
- The maximum clique problem (Q1318271) (← links)
- Genetic algorithms and tabu search: Hybrids for optimization (Q1342325) (← links)
- The tabu search metaheuristic: How we used it (Q1356212) (← links)
- A new extension of local search applied to the Dial-A-Ride problem (Q1388930) (← links)
- A variable neighborhood search for graph coloring. (Q1410622) (← links)
- A tabu search algorithm for finding good forest harvest schedules satisfying green-up constraints (Q1609903) (← links)
- EPCOT: An efficient procedure for coloring optimally with Tabu Search (Q1802494) (← links)
- Greedy randomized adaptive search procedures (Q1804580) (← links)
- Solving transportation problems with nonlinear side constraints with tabu search (Q1892666) (← links)
- Polynomially solvable cases for the maximum stable set problem (Q1894362) (← links)
- Tabu search for graph partitioning (Q1919841) (← 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)
- Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
- A survey of local search methods for graph coloring (Q2489304) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
- A New Composite Algorithm for Clustering Problems (Q4344451) (← links)
- Mining relevant information on the Web: a clique-based approach (Q5444416) (← links)