Pages that link to "Item:Q2506180"
From MaRDI portal
The following pages link to Lower bound improvement and forcing rule for quadratic binary programming (Q2506180):
Displayed 9 items.
- 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)
- 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)
- 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)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem (Q5459821) (← links)