Pages that link to "Item:Q1919841"
From MaRDI portal
The following pages link to Tabu search for graph partitioning (Q1919841):
Displaying 8 items.
- An effective multilevel tabu search approach for balanced graph partitioning (Q622162) (← links)
- A tabu search procedure for the resource constrained project scheduling problem with discounted cash flows (Q1342100) (← links)
- Solution of large weighted equicut problems (Q1609912) (← links)
- Graph bisection revisited (Q1657405) (← links)
- Moving clusters within a memetic algorithm for graph partitioning (Q1665049) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems (Q2355937) (← links)
- Local search for constrained graph clustering in biological networks (Q2668745) (← links)
