Pages that link to "Item:Q1919840"

The following pages link to Diversification strategies in tabu search algorithms for the maximum clique problem (Q1919840):

Displaying 9 items.

• The vehicle-routing problem with time windows and driver-specific times (Q322409) (← links)
• A tabu search algorithm for the covering design problem (Q415558) (← links)
• A tabu search algorithm for self-healing ring network design. (Q1410612) (← links)
• Detecting robust cliques in graphs subject to uncertain edge failures (Q1640046) (← links)
• Diversification strategies in local search for a nonbifurcated network loading problem (Q1848356) (← links)
• Metaheuristics: A bibliography (Q1919858) (← links)
• A tabu search procedure based on a random roulette diversification for the weighted maximal planar graph problem (Q2489303) (← links)
• A metaheuristic to solve a location-routing problem with nonlinear costs (Q2491322) (← links)
• Probabilistic Tabu search with multiple neighborhoods for the Disjunctively Constrained Knapsack Problem (Q4603929) (← links)