Pages that link to "Item:Q2392866"
From MaRDI portal
The following pages link to LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866):
Displaying 11 items.
- The MIN-cut and vertex separator problem (Q683339) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- Improved exact approaches for row layout problems with departments of equal length (Q1651703) (← links)
- Efficient semidefinite branch-and-cut for MAP-MRF inference (Q1800052) (← links)
- A branch-and-cut algorithm for solving mixed-integer semidefinite optimization problems (Q2301146) (← links)
- Semidefinite programming and eigenvalue bounds for the graph partition problem (Q2349129) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem (Q2967612) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
- Cardinality-constrained distributionally robust portfolio optimization (Q6112845) (← links)
- A Decomposition Augmented Lagrangian Method for Low-Rank Semidefinite Programming (Q6116234) (← links)
