Pages that link to "Item:Q1290621"

The following pages link to Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621):

Displaying 5 items.

• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method (Q946351) (← links)
• Cutting planes for RLT relaxations of mixed 0-1 polynomial programs (Q2349139) (← links)
• A simplified binary artificial fish swarm algorithm for 0-1 quadratic knapsack problems (Q2349685) (← links)
• Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)