Pages that link to "Item:Q2491324"

The following pages link to Lagrangian smoothing heuristics for Max-cut (Q2491324):

Displaying 7 items.

• An augmented Lagrangian method for binary quadratic programming based on a class of continuous functions (Q279813) (← links)
• A new discrete filled function method for solving large scale max-cut problems (Q438797) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• An efficient Lagrangian smoothing heuristic for max-cut (Q549567) (← links)
• Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
• A discrete filled function algorithm for approximate global solutions of max-cut problems (Q939569) (← links)
• A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)