Pages that link to "Item:Q339560"
From MaRDI portal
The following pages link to Memetic search for the max-bisection problem (Q339560):
Displaying 5 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)
