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

The American Mathematical Monthly 50

Buck, R.C.: Partition of space · 1943

Earlier work this paper cites.

No. 154 in Memoirs of the American Mathematical Society. American Mathematical Society (1975)

Zaslavsky, T.: Facing up to Arrangements: Face-Count Formulas for Partitions of Space by Hyperplanes · 1975

Earlier work this paper cites.

SIAM Journal on Computing 15

Edelsbrunner, H., O’Rouke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications · 1986

Earlier work this paper cites.

J. Glob. Optim. 1

Pardalos, P.M., Vavasis, S.A.: Quadratic programming with one negative eigenvalue is NP-hard · 1991

Earlier work this paper cites.

Oxford University Press, Inc. (1991)

Vavasis, S.A.: Nonlinear Optimization: Complexity Issues · 1991

Cited alongside, same era.

Society for Industrial and Applied Mathematics (1998)

Stewart, G.W.: Matrix Algorithms: Volume 1: Basic Decompositions · 1998

Cited alongside, same era.

Mathematical Programming 91

Allemand, K., Fukuda, K., Liebling, T.M., Steiner, E.: A polynomial case of unconstrained zero-one quadratic optimization · 2001

Cited alongside, same era.

European Journal of Operational Research 166

Ferrez, J.A., Fukuda, K., Liebling, T.M.: Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm · 2003

Later among the works it cites.

Springer-Verlag, Berlin (2005)

Edelsbrunner, H., Springer-Verlag (Berlin): Algorithms in Combinatorial Geometry · 2005

Later among the works it cites.

Springer Science & Business Media (2012)

Ziegler, G.M.: Lectures on Polytopes · 2012

Later among the works it cites.