Pages that link to "Item:Q2287710"

The following pages link to A novel formulation of the max-cut problem and related algorithm (Q2287710):

Displaying 9 items.

• Canonical dual approach to solving the maximum cut problem (Q693126) (← links)
• A new technique for the link slice problem (Q1060741) (← links)
• Node and edge relaxations of the max-cut problem (Q1319044) (← links)
• A fixed-parameter algorithm for the Max-Cut problem on embedded 1-planar graphs (Q1670994) (← links)
• A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
• Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
• A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324) (← links)
• An improved fixed-parameter algorithm for max-cut parameterized by crossing number (Q2301753) (← links)
• Advanced scatter search for the max-cut problem (Q2901043) (← links)