arXiv:1911.10877 · Optimization Letters

A new polynomially solvable class of quadratic optimization problems with box constraints

Milan Hladík, Michal Černý, Miroslav Rada

Published Feb 19, 2021• 6 citations

Related papers

Polynomial time solvable algorithms to a class of unconstrained and linearly constrained binary quadratic programming problems

Shenshen Gu, Rui Cui, Peng Jiao

A Polyhedral Approach for Nonconvex Quadratic Programming Problems with Box Constraints

Yasutoshi Yajima, Tetsuya Fujie

Globally solving nonconvex quadratic programming problems with box constraints via integer programming methods

Pierre Bonami, Oktay Günlük, Jeff Linderoth

Fix and bound: an efficient approach for solving large-scale quadratic programming problems with box constraints

Marco Locatelli, Veronica Piccialli, Antonio M. Sudoso

Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

Eranda Çela, Bettina Klinz, Christophe Meyer

A Characterization of Binary Quadratic Optimization Problems

최혜지