✦ LIBER ✦

[Lecture Notes in Computer Science] Integer Programming and Combinatorial Optimization Volume 1412 || New Classes of Lower Bounds for Bin Packing Problems

✍ Scribed by Bixby, Robert E.; Boyd, E. Andrew; Ríos-Mercado, Roger Z.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Inte

✍ Bixby, Robert E.; Boyd, E. Andrew; Ríos-Mercado, Roger Z. 📂 Article 📅 1998 🏛 Springer Berlin Heidelberg ⚖ 211 KB

[Lecture Notes in Computer Science] Inte

✍ Cook, William J.; Schulz, Andreas S. 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg ⚖ 299 KB

[Lecture Notes in Computer Science] Inte

✍ Fischetti, Matteo; Williamson, David P. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg ⚖ 386 KB

[Lecture Notes in Computer Science] Inte

✍ Lodi, Andrea; Panconesi, Alessandro; Rinaldi, Giovanni 📂 Article 📅 2008 🏛 Springer Berlin Heidelberg ⚖ 265 KB

[Lecture Notes in Computer Science] Inte

✍ Aardal, Karen; Gerards, Bert 📂 Article 📅 2001 🏛 Springer Berlin Heidelberg ⚖ 130 KB

[Lecture Notes in Computer Science] Evol

✍ Merz, Peter; Hao, Jin-Kao 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg ⚖ 322 KB