✦ LIBER ✦

Warehouse-Retailer Network Design Problem

✍ Scribed by Teo, Chung-Piaw; Shu, Jia

Book ID: 121654871
Publisher: INFORMS
Year: 2004
Tongue: English
Weight: 277 KB
Volume: 52
Category: Article
ISSN: 0030-364X
DOI: 10.1287/opre.1030.0096

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An approximation algorithm for thek-medi

An approximation algorithm for thek-median warehouse-retailer network design problem

✍ Li, Yu; Xiu, NaiHua; Xu, DaChuan 📂 Article 📅 2013 🏛 SP Science China Press 🌐 English ⚖ 166 KB

The one-warehouse multi-retailer problem

The one-warehouse multi-retailer problem: reformulation, classification, and computational results

✍ Oğuz Solyalı, Haldun Süral 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 751 KB

The one-warehouse multi-retailer problem

The one-warehouse multi-retailer problem: reformulation, classification, and computational results

✍ Oğuz Solyalı, Haldun Süral 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 751 KB

A New Heuristic for one Warehouse and N

A New Heuristic for one Warehouse and N Retailers Problem

✍ Senyigit, Ercan; Akkan, Hakan 📂 Article 📅 2012 🏛 Elsevier 🌐 English ⚖ 445 KB

Solving a Network Design Problem

✍ Alain Chabrier; Emilie Danna; Claude Le Pape; Laurent Perron 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 153 KB

The hierarchical network design problem

✍ John R. Current; Charles S. ReVelle; Jared L. Cohon 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 692 KB

In this paper the authors introduce the hierarchical network design problem (HNDP). The object of the HNDP is to identify the least cost, two-level hierarchical network. The network must include a primary path from a predetermined starting node to a predetermined terminus node. In addition, each nod