𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new lower bound for the non-oriented two-dimensional bin-packing problem

✍ Scribed by François Clautiaux; Antoine Jouglet; Joseph El Hayek

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
183 KB
Volume
35
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

✦ Synopsis

We propose a new scheme for computing lower bounds for the non-oriented bin-packing problem when the bin is a square. It leads to bounds that theoretically dominate previous results. Computational experiments show that the bounds are tight. We also discuss the case where the bin is not a square.

📜 SIMILAR VOLUMES

A New Lower Bound for the Football Pool
A New Lower Bound for the Football Pool Problem for Six Matches
✍ Patric R.J. Östergård; Alfred Wassermann 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

In the football pool problem one wants to minimize the cardinality of a ternary code, C F n 3 ; with covering radius one, and the size of a minimum code is denoted by s n : The smallest unsettled case is 634s 6 473: The lower bound is here improved to 65 in a coordinate-by-coordinate backtrack searc