Pages that link to "Item:Q4427330"
From MaRDI portal
The following pages link to Solving Graph Bisection Problems with Semidefinite Programming (Q4427330):
Displaying 8 items.
- Memetic search for the max-bisection problem (Q339560) (← links)
- A nonmonotone GRASP (Q340011) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step (Q411535) (← links)
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
- An exact combinatorial algorithm for minimum graph bisection (Q747771) (← links)
- (Q5140710) (← links)
- Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293) (← links)
