Pages that link to "Item:Q1758877"
From MaRDI portal
The following pages link to A gradient-based randomised heuristic for the maximum cut problem (Q1758877):
Displaying 5 items.
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- From Graph Orientation to the Unweighted Maximum Cut (Q2817879) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- On the optimality of the random hyperplane rounding technique for MAX CUT (Q4537629) (← links)
- A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264) (← links)