A Study on Coefficient Reduction of Binary Knapsack Inequalities [chapter]

Gary J. Koehler
2002 Operations Research/Computer Science Interfaces Series  
In 1975, Bradley, Hammer and Wolsey characterized the minimal representation of binary knapsack problems. A linear programming formulation for this problem often gave integral solutions leading the authors to state "We know of no satisfactory explanation of why the large fraction of linear programming optimal solutions are integer for this problem." This paper provides a study of this phenomenon.
doi:10.1007/978-1-4615-0893-9_7 fatcat:vqiljcuwg5c5ley3ys4dvsejza