Pages that link to "Item:Q339560"

The following pages link to Memetic search for the max-bisection problem (Q339560):

Displaying 10 items.

• Tabu search for the cyclic bandwidth problem (Q337475) (← links)
• Hybridization of tabu search with feasible and infeasible local searches for the quadratic multiple knapsack problem (Q342188) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
• An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
• Reinforcement learning based tabu search for the minimum load coloring problem (Q2147014) (← links)
• An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
• A hybrid metaheuristic method for the maximum diversity problem (Q2356110) (← links)