✦ LIBER ✦

The single item uncapacitated lot-sizing problem with time-dependent batch sizes: NP-hard and polynomial cases

✍ Scribed by Akbalik, Ayse; Rapine, Christophe

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial time algorithms for the const

✍ Ayse Akbalik; Christophe Rapine 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 289 KB

A polynomial time algorithm for the sing

✍ Hellion, Bertrand; Mangione, Fabien; Penz, Bernard 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 396 KB

A polynomial time algorithm to solve the

✍ Bertrand Hellion; Fabien Mangione; Bernard Penz 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 547 KB

Corrigendum to “A polynomial time algori

✍ Hellion, Bertrand; Mangione, Fabien; Penz, Bernard 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 185 KB

A hybrid simulated annealing for the sin

✍ Mohammad Mirabi 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 369 KB