✦ LIBER ✦

An Algorithm for Solving Dynamic Capacitated Plant Location Problems with Discrete Expansion Sizes

✍ Scribed by Alexander Shulman

Book ID: 118248283
Publisher: INFORMS
Year: 1991
Tongue: English
Weight: 453 KB
Volume: 39
Category: Article
ISSN: 0030-364X
DOI: 10.2307/171396

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for solving large capacitat

An algorithm for solving large capacitated warehouse location problems

✍ J.E. Beasley 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 817 KB

An exact algorithm for solving a capacit

An exact algorithm for solving a capacitated location-routing problem

✍ G. Laporte; Y. Nobert; D. Arpin 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 830 KB

An exact algorithm for the capacitated f

An exact algorithm for the capacitated facility location problems with single sourcing

✍ Kaj Holmberg; Mikael Rönnqvist; Di Yuan 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 168 KB

Facility location problems are often encountered in many areas such as distribution, transportation and telecommunication. We describe a new solution approach for the capacitated facility location problem in which each customer is served by a single facility. An important class of heuristic solution

An efficient algorithm for the capacitat

An efficient algorithm for the capacitated single item dynamic lot size problem

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

An integer decomposition algorithm for s

An integer decomposition algorithm for solving a two-stage facility location problem with second-stage activation costs

✍ John Penuel; J. Cole Smith; Yang Yuan 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 231 KB

An improved algorithm for the dynamic lo

An improved algorithm for the dynamic lot-sizing problem with learning effect in setups

✍ Kavindra Malik; Yufei Wang 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 368 KB 👁 1 views