Pages that link to "Item:Q2644353"
From MaRDI portal
The following pages link to A continuation algorithm for max-cut problem (Q2644353):
Displaying 10 items.
- An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
- A remark on max-cut problem with an application to digital-analogue convertors (Q1071657) (← links)
- A gradient-based randomised heuristic for the maximum cut problem (Q1758877) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
- Lagrangian smoothing heuristics for Max-cut (Q2491324) (← links)
- Advanced scatter search for the max-cut problem (Q2901043) (← links)
- (Q3573969) (← links)
- (Q5440597) (← links)
- (Q5875545) (← links)