✦ LIBER ✦

The three-dimensional assignment and partition problems. New lower bounds

✍ Scribed by S. I. Sergeev

Book ID: 110152342
Publisher: SP MAIK Nauka/Interperiodica
Year: 2006
Tongue: English
Weight: 137 KB
Volume: 67
Category: Article
ISSN: 0005-1179
DOI: 10.1134/s0005117906020044

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New lower bounds for the three-dimension

New lower bounds for the three-dimensional finite bin packing problem

✍ Marco A. Boschetti 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 375 KB

A new lower bound for the quadratic assi

A new lower bound for the quadratic assignment problem

✍ S.I. Sergeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 549 KB

New lower bounds for the triplanar assig

New lower bounds for the triplanar assignment problem. Use of the classical model

✍ S. I. Sergeev 📂 Article 📅 2008 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 637 KB

Upper and lower bounds for the fixed spe

Upper and lower bounds for the fixed spectrum frequency assignment problem

✍ Roberto Montemanni 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 41 KB

The Two-Dimensional Finite Bin Packing P

The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds

✍ Marco A. Boschetti; Aristide Mingozzi 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 128 KB

A new lower bound for the non-oriented t

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

✍ François Clautiaux; Antoine Jouglet; Joseph El Hayek 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 183 KB

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.