Pages that link to "Item:Q939569"

The following pages link to A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569):

Displaying 8 items.

• A continuously differentiable filled function method for global optimization (Q398594) (← 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 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)
• A modified tunneling function method for non-smooth global optimization and its application in artificial neural network (Q2285350) (← links)
• A filled function which has the same local minimizer of the objective function (Q2311108) (← links)