The quadratic formula learned by generations of math students is difficult to remember, but it can be used to solve quadratic equations where y = 0.

This paper develops an algorithm to solve certain quadratic set-covering problems where the constraint set is of the inequality type. It extends one of Bellmore and Ratliff for linear set-covering ...

In this paper, we present a branch-and-bound algorithm for the exact solution of the Tree QAP based on an integer programming formulation of the problem. The bounds are computed using a Lagrangian ...