Pages that link to "Item:Q2506180"

The following pages link to Lower bound improvement and forcing rule for quadratic binary programming (Q2506180):

Displaying 15 items.

• The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
• An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
• Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
• On duality gap in binary quadratic programming (Q454277) (← links)
• Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
• Global optimality conditions and optimization methods for quadratic integer programming problems (Q652691) (← links)
• Stability of semilinear elliptic optimal control problems with pointwise state constraints (Q694597) (← links)
• The spherical constraint in Boolean quadratic programs (Q925238) (← links)
• Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
• The equitable dispersion problem (Q1011261) (← links)
• Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
• Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
• On characterization of maximal independent sets via quadratic optimization (Q2359154) (← links)
• Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
• On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)