Pages that link to "Item:Q2491340"

The following pages link to A study of ACO capabilities for solving the maximum clique problem (Q2491340):

Displaying 11 items.

• Breakout local search for maximum clique problems (Q339563) (← links)
• Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization (Q932221) (← links)
• Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
• A new discrete electromagnetism-based meta-heuristic for solving the multidimensional knapsack problem using genetic operators (Q1937869) (← links)
• An ant colony optimization approach for the multidimensional knapsack problem (Q2267820) (← links)
• Subgraph extraction and metaheuristics for the maximum clique problem (Q2359135) (← links)
• A review on algorithms for maximum clique problems (Q2630214) (← links)
• Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) (← links)
• Solving maximum clique problem using chemical reaction optimization (Q6059882) (← links)