𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the exact separation of mixed integer knapsack cuts

✍ Scribed by Ricardo Fukasawa; Marcos Goycoolea

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
300 KB
Volume
128
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the separation of disjunctive cuts
On the separation of disjunctive cuts
✍ Matteo Fischetti; Andrea Lodi; Andrea Tramontani πŸ“‚ Article πŸ“… 2009 πŸ› Springer-Verlag 🌐 English βš– 548 KB
On the Exact Height of Integer-Detecting
On the Exact Height of Integer-Detecting Sequences
✍ C. Elsner; J.W. Sander πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 244 KB

Some time ago, the concept of integer-detecting sequences of exact height ! was introduced. So far all the occurring exact heights were rational numbers, in fact even unit fractions. Otherwise it was known that 0<! 1Γ‚3. We show that every positive real number not exceeding 1Γ‚3 is the exact height of

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.