𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A computational study on the quadratic knapsack problem with multiple constraints

✍ Scribed by Haibo Wang; Gary Kochenberger; Fred Glover

Book ID
108107013
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
481 KB
Volume
39
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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