✦ LIBER ✦

A computational comparison of gomory and knapsack cuts

✍ Scribed by Larry Jenkins; Dave Peters

Publisher: Elsevier Science
Year: 1987
Tongue: English
Weight: 805 KB
Volume: 14
Category: Article
ISSN: 0305-0548
DOI: 10.1016/0305-0548(87)90041-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Several notes on the power of Gomory–Chv

Several notes on the power of Gomory–Chvátal cuts

✍ Edward A. Hirsch; Arist Kojevnikov 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 201 KB

Computational aspects of hard Knapsack p

Computational aspects of hard Knapsack problems

✍ L. Caccetta; A. Kulanoot 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 559 KB

A characterization of knapsacks with the

A characterization of knapsacks with the max-flow-—min-cut property

✍ M Laurent; A Sassano 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 399 KB

A computational comparison of reformulat

A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes

✍ A. Frangioni; C. Gentile 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 757 KB

Computational results with a branch-and-

Computational results with a branch-and-bound algorithm for the general knapsack problem

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

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