✦ LIBER ✦

The Bin-Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP

✍ Scribed by P. Schwerin; G. Wäscher

Book ID: 111205612
Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 839 KB
Volume: 4
Category: Article
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.1997.tb00093.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The FFD algorithm for the bin packing pr

The FFD algorithm for the bin packing problem with kernel items

✍ Zhang Guochuan; Yao Enyu 📂 Article 📅 1998 🏛 SP Editorial Committee of Applied Mathematics - A 🌐 English ⚖ 273 KB

A greedy search for the three-dimensiona

A greedy search for the three-dimensional bin packing problem: the packing static stability case

✍ J. L. De Castro Silva; N. Y. Soma; N. Maculan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 321 KB

Lower Bound for the Online Bin Packing P

Lower Bound for the Online Bin Packing Problem with Restricted Repacking

✍ Balogh, János; Békési, József; Galambos, Gábor; Reinelt, Gerhard 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 192 KB

A branch-and-price algorithm for the var

A branch-and-price algorithm for the variable size bin packing problem with minimum filling constraint

✍ Andrea Bettinelli; Alberto Ceselli; Giovanni Righini 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 492 KB

Computational study of a column generati

Computational study of a column generation algorithm for bin packing and cutting stock problems

✍ François Vanderbeck 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 184 KB

Average-case analysis of the bin-packing

Average-case analysis of the bin-packing problem with general cost structures

✍ Julien Bramel; WanSoo T. Rhee; David Simchi-Levi 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 100 KB

We consider a version of the famous bin-packing problem where the cost of a bin is a concave function of the number of items in the bin. We analyze the problem from an average-case point of view and develop techniques to determine the asymptotic optimal solution value for a variety of functions. We