Pages that link to "Item:Q427399"

The following pages link to An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399):

Displaying 9 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• A polynomial case of convex integer quadratic programming problems with box integer constraints (Q496616) (← links)
• A semi-supervised random vector functional-link network based on the transductive framework (Q2282876) (← links)
• Closed-form formulas for evaluating \(r\)-flip moves to the unconstrained binary quadratic programming problem (Q2333129) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs (Q2696928) (← links)
• An Ellipsoidal Bounding Scheme for the Quasi-Clique Number of a Graph (Q3386796) (← links)
• Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
• Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)