Pages that link to "Item:Q438797"
From MaRDI portal
The following pages link to A new discrete filled function method for solving large scale max-cut problems (Q438797):
Displaying 6 items.
- 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 discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
- A discrete filled function algorithm embedded with continuous approximation for solving max-cut problems (Q1014949) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- Non parameter-filled function for global optimization (Q2661039) (← links)