Efficient Computation of the Binary Vector That Maximizes a Rank-Deficient Quadratic Form

Concise RLT forms of binary programs: A

Concise RLT forms of binary programs: A computational study of the quadratic knapsack problem

✍ Richard J. Forrester; Warren P. Adams; Paul T. Hadavas 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 137 KB

## Abstract The reformulation‐linearization technique (RLT) is a methodology for constructing tight linear programming relaxations of mixed discrete problems. A key construct is the multiplication of “product factors” of the discrete variables with problem constraints to form polynomial restriction