๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Proofs of Correctness and Properties of Integer Adder Circuits

โœ Scribed by Gang Chen; Feng Liu

Book ID
118698068
Publisher
IEEE
Year
2010
Tongue
English
Weight
79 KB
Volume
59
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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.