Global optimization techniques for solving the general quadratic integer programming problem
From MaRDI portal
Publication:1384092
DOI10.1023/A:1018364802456zbMath0896.90150OpenAlexW1899623501MaRDI QIDQ1384092
Publication date: 1 October 1998
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1018364802456
global optimizationconcave minimizationquadratic integer programmingbranch-and-bound algorithmsgeneral quadratic function
Related Items (9)
Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Two-stage quadratic integer programs with stochastic right-hand sides ⋮ Global optimality conditions and optimization methods for quadratic integer programming problems ⋮ An improved linearization strategy for zero-one quadratic programming problems ⋮ A derivative algorithm for inexact quadratic program -- application to environmental decision-making under uncertainty ⋮ On the relationship between the integer and continuous solutions of convex programs ⋮ Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming ⋮ A filled function method for quadratic programs with binary constraints†
This page was built for publication: Global optimization techniques for solving the general quadratic integer programming problem