MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE

DOI10.15807/jorsj.23.171zbMath0451.90092OpenAlexW2341349967MaRDI QIDQ3898345

Hiroshi Konno

Publication date: 1980

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.23.171

zbMATH Keywords

algorithmbilinear programmingglobal maximumcutting plane approachbilinear knapsack problemclassical combinatorial problemconvex quadratic objective functionmaximization over a unit hypercube

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Quadratic programming (90C20) Boolean programming (90C09)

Related Items (7)

Introduction to QUBO ⋮ The Bipartite QUBO ⋮ An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach ⋮ Maximization of a PSD quadratic form and factorization ⋮ Linear multiplicative programming ⋮ Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms ⋮ Computational complexity of norm-maximization

This page was built for publication: MAXIMIZING A CONVEX QUADRATIC FUNCTION OVER A HYPERCUBE