Pages that link to "Item:Q2506169"

The following pages link to A semidefinite programming based polyhedral cut and price approach for the maxcut problem (Q2506169):

Displaying 11 items.

• Memetic search for the max-bisection problem (Q339560) (← links)
• Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem (Q489116) (← links)
• A second-order cone cutting surface method: Complexity and application (Q839677) (← links)
• A matrix generation approach for eigenvalue optimization (Q868452) (← links)
• Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel (Q895077) (← links)
• Optimization over structured subsets of positive semidefinite matrices via column generation (Q1751222) (← links)
• Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← links)
• Comments on: Stability in linear optimization and related topics. A personal tour (Q1939065) (← links)
• Polyhedral approximations of the semidefinite cone and their application (Q2028478) (← links)
• Improving the linear relaxation of maximum \(k\)-cut with semidefinite-based constraints (Q2287849) (← links)
• Speeding up a memetic algorithm for the max-bisection problem (Q2353470) (← links)