Pages that link to "Item:Q622162"

The following pages link to An effective multilevel tabu search approach for balanced graph partitioning (Q622162):

Displaying 17 items.

• An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
• A combined evolutionary search and multilevel optimisation approach to graph-partitioning (Q1888147) (← links)
• Tabu search for graph partitioning (Q1919841) (← links)
• A variable neighborhood search approach for the vertex bisection problem (Q2201641) (← links)
• Stagnation-aware breakout tabu search for the minimum conductance graph partitioning problem (Q2273653) (← links)
• A reactive self-tuning scheme for multilevel graph partitioning (Q2422870) (← links)
• A new method, the fusion fission, for the relaxed \(k\)-way graph partitioning problem, and comparisons with some multilevel algorithms (Q2466393) (← links)
• Local search for constrained graph clustering in biological networks (Q2668745) (← links)
• Metaheuristics for the minimum gap graph partitioning problem (Q2668747) (← links)
• A discrete dynamic convexized method for VLSI circuit partitioning (Q2867400) (← links)
• The main tools and test benches for graph partitioning (Q2912428) (← links)
• Evaluation of a Flow-Based Hypergraph Bipartitioning Algorithm (Q5075796) (← links)
• Advanced Tabu Search Algorithms for Bipartite Boolean Quadratic Programs Guided by Strategic Oscillation and Path Relinking (Q5139848) (← links)
• Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams (Q5140733) (← links)
• Multilevel graph partitioning: an evolutionary approach (Q5464430) (← links)
• ILP-Based Local Search for Graph Partitioning (Q6039924) (← links)
• A multilevel tabu search algorithm for balanced partitioning of unstructured grids (Q6558894) (← links)