✦ LIBER ✦

Note: On the set-union knapsack problem

✍ Scribed by Olivier Goldschmidt; David Nehme; Gang Yu

Publisher: John Wiley and Sons
Year: 1994
Tongue: English
Weight: 558 KB
Volume: 41
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(199410)41:6<833::aid-nav3220410611>3.0.co;2-q

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Cover inequalities for robust knapsack s

Cover inequalities for robust knapsack sets—Application to the robust bandwidth packing problem

✍ Olivier Klopfenstein; Dritan Nace 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 226 KB

## Abstract The robust optimization framework proposed by Bertsimas and Sim accounts for data uncertainty in integer linear programs. This article investigates the polyhedral impacts of this robust model for the 0‐1 knapsack problem. In particular, classical cover cuts are adapted to provide valid

A Note on the Stockhausen Problem

✍ Ronald C. Read; Lily Yen 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 295 KB

We consider problems in the enumeration of sequences suggested by the problem of determining the number of ways of performing a piano composition (Klavierstu ck XI) by Karlheinz Stockhausen.

Note on the E-E Problem

✍ Hans Kleine Büning 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 364 KB

Note on the Lamp Lighting Problem

✍ Henrik Eriksson; Kimmo Eriksson; Jonas Sjöstrand 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 143 KB

We answer some questions concerning the so-called σ-game of Sutner [Linear cellular automata and the Garden of Eden, Math. Intelligencer 11 (1989), 49-53]. It is played on a graph where each vertex has a lamp, the light of which is toggled by pressing any vertex with an edge directed to the lamp. Fo

A heuristic solution procedure for the m

A heuristic solution procedure for the multiconstraint zero-one knapsack problem

✍ Hasan Pirkul 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 700 KB

On the Set LCS and Set-Set LCS Problems

✍ B.F. Wang; G.H. Chen; K. Park 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 431 KB

We consider two generalizations of the longest common subsequence (LCS) problem: the Set LCS problem and the Set-Set LCS problem. We present algorithms for the two problems that are faster than the previous ones by Hirschberg and Larmore. 1993 Academic Press, Inc.