✦ LIBER ✦

New polynomial bounds for matroidal knapsacks

✍ Scribed by Lígia Amado; Paulo Barcia

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 536 KB
Volume: 95
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(95)00248-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matroidal relaxations for 0–1 knapsack p

Matroidal relaxations for 0–1 knapsack problems

✍ Lígia Amado; Paulo Barcia 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 379 KB

New degree bounds for polynomial thresho

New degree bounds for polynomial threshold functions

✍ Ryan O’Donnell; Rocco A. Servedio 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 688 KB

Bounds for nested knapsack problems

✍ Robert E. Johnston; Lutfar R. Khan 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 688 KB

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

Bounds for an interval polynomial

✍ J. Rokne 📂 Article 📅 1977 🏛 Springer Vienna 🌐 English ⚖ 662 KB

Bounds on the size of branch-and-bound p

Bounds on the size of branch-and-bound proofs for integer knapsacks

✍ Bala Krishnamoorthy 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 172 KB

Using a direct counting argument, we derive lower and upper bounds for the number of nodes enumerated by linear programming-based branch-and-bound (B&B) method to prove the integer infeasibility of a knapsack. We prove by example that the size of the B&B tree could be exponential in the worst case.