Global optimization techniques for solving the general quadratic integer programming problem

DOI10.1023/A:1018364802456zbMath0896.90150MaRDI QIDQ1384092

Nguyen Van Thoai

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

zbMATH Keywords

global optimization; concave minimization; quadratic integer programming; branch-and-bound algorithms; general quadratic function

Mathematics Subject Classification ID

90C10: Integer programming

90C20: Quadratic programming

Related Items

A filled function method for quadratic programs with binary constraints†, 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, An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach, Two-stage quadratic integer programs with stochastic right-hand sides, Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach, Global optimality conditions and optimization methods for quadratic integer programming problems, An improved linearization strategy for zero-one quadratic programming problems, Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming