✦ LIBER ✦

A new lower bound for the linear knapsack problem with general integer variables

✍ Scribed by Kamlesh Mathur; Prahalad Venkateshan

Book ID: 108118116
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 236 KB
Volume: 178
Category: Article
ISSN: 0377-2217
DOI: 10.1016/j.ejor.2006.02.018

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New pseudopolynomial complexity bounds f

New pseudopolynomial complexity bounds for the bounded and other integer Knapsack related problems

✍ Arie Tamir 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 688 KB

A lower bound of 12n2 on linear search p

A lower bound of 12n2 on linear search programs for the Knapsack problem

✍ David Dobkin; Richard J. Lipton 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 234 KB

Generating lower bounds for the linear a

Generating lower bounds for the linear arrangement problem

✍ Weiguo Liu; Anthony Vannelli 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 806 KB

A general lower bound for the makespan p

A general lower bound for the makespan problem

✍ S.T. Webster 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 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

A lower time bound for the knapsack prob

A lower time bound for the knapsack problem on random access machines

✍ Peter Klein; Friedhelm Meyer Heide 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 533 KB

a.M. (Fed. Rep.) Summary. We consider random access machines which read the input integer by integer (not bit by bit). For this computational model we prove a quadratic lower bound for the n-dimensional knapsack problem. For this purpose, we combine a method due to Paul and Simon [1] to apply decisi