Pages that link to "Item:Q1761827"
From MaRDI portal
The following pages link to A discrete dynamic convexized method for the max-cut problem (Q1761827):
Displaying 4 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
