Polynomial-Time Methods to Solve Unimodular Quadratic Programs With Performance Guarantees

Shankarachary Ragi, Edwin K. P. Chong, Hans D. Mittelmann

We develop polynomial-time heuristic methods to solve unimodular quadratic programs (UQPs) approximately, which are known to be NP-hard. In the UQP framework, we maximize a quadrat…