✦ LIBER ✦

Polynomial time algorithms for the constant capacitated single-item lot sizing problem with stepwise production cost

✍ Scribed by Ayse Akbalik; Christophe Rapine

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An FPTAS for a single-item capacitated e

✍ Sergei Chubanov; Mikhail Y. Kovalyov; Erwin Pesch 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 191 KB

A polynomial time algorithm to solve the

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

An effective algorithm for the capacitat

✍ Chia-Shin Chung; James Flynn; Chien-Hua Mike Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 1013 KB

An efficient algorithm for the capacitat

✍ Ömer Kirca 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 713 KB

An FPTAS for the single-item capacitated

✍ Sergei Chubanov; Erwin Pesch 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 217 KB

Linear-programming extended formulations

✍ Mathieu Van Vyve 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 239 KB