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 13 items.
- An effective discrete dynamic convexized method for solving the winner determination problem (Q306103) (← links)
- A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
- Solving the maxcut problem by the global equilibrium search (Q466339) (← 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)
- A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
- A gradient-based randomised heuristic for the maximum cut problem (Q1758877) (← links)
- Dijkstra's algorithm and L-concave function maximization (Q2248748) (← links)
- A cutting method for finding discrete minimax with dropping of cutting planes (Q2263093) (← links)
- A max-cut approximation using a graph based MBO scheme (Q2326619) (← links)
- A discrete dynamic convexized method for VLSI circuit partitioning (Q2867400) (← links)
- Graph partitioning: an updated survey (Q6110873) (← links)
