Pages that link to "Item:Q1373750"
From MaRDI portal
The following pages link to A branch-and-cut algorithm for the equicut problem (Q1373750):
Displaying 18 items.
- From equipartition to uniform cut polytopes: extended polyhedral results (Q533779) (← links)
- Performance of a genetic algorithm for the graph partitioning problem (Q596896) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Solution of large weighted equicut problems (Q1609912) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- An exact algorithm for min-max hyperstructure equipartition with a connected constraint (Q1652415) (← links)
- A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
- An exact algorithm for graph partitioning (Q1942271) (← links)
- Models and methods for solving the problem of network vulnerability (Q1951863) (← links)
- An overview of graph covering and partitioning (Q2142633) (← links)
- Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)
- Facet-defining inequalities for the simple graph partitioning polytope (Q2467133) (← links)
- Finding optimal solutions to the graph partitioning problem with heuristic search (Q2502154) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm (Q4966750) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
