Pages that link to "Item:Q1384092"
From MaRDI portal
The following pages link to Global optimization techniques for solving the general quadratic integer programming problem (Q1384092):
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)
- An improved linearization strategy for zero-one quadratic programming problems (Q2458902) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)
- A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty (Q5925864) (← links)
- On the relationship between the integer and continuous solutions of convex programs (Q5949923) (← links)