Pages that link to "Item:Q1262136"

The following pages link to STABULUS: A technique for finding stable sets in large graphs with tabu search (Q1262136):

Displaying 33 items.

• Breakout local search for maximum clique problems (Q339563) (← links)
• An adaptive multistart tabu search approach to solve the maximum clique problem (Q358651) (← links)
• Essential particle swarm optimization queen with tabu search for MKP resolution (Q488403) (← links)
• Simulated versus reduced noise quantum annealing in maximum independent set solution to wireless network scheduling (Q669802) (← links)
• 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)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Clustered maximum weight clique problem: algorithms and empirical analysis (Q1652358) (← links)
• Multi-neighborhood tabu search for the maximum weight clique problem (Q1761843) (← 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)
• An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
• Solving the maximum clique problem using a tabu search approach (Q2367014) (← links)
• A branch-and-price algorithm for the robust graph coloring problem (Q2448920) (← 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 review on algorithms for maximum clique problems (Q2630214) (← links)
• A new binary (17,4,5) constant weight code (Q6159452) (← links)