✦ LIBER ✦

An exact algorithm for the min-cost network containment problem

✍ Scribed by Raffaele Pesenti; Franca Rinaldi; Walter Ukovich

Publisher: John Wiley and Sons
Year: 2004
Tongue: English
Weight: 197 KB
Volume: 43
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10106

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An exact algorithm for the Traveling Sal

An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections

✍ R. Baldacci; E. Hadjiconstantinou; A. Mingozzi 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 182 KB 👁 1 views

An exact algorithm for the elementary sh

An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems

✍ Dominique Feillet; Pierre Dejax; Michel Gendreau; Cyrille Gueguen 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 149 KB

An exact algorithm for the batch sequenc

An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer

✍ A. Agnetis; F. Rossi; G. Gristina 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB 👁 2 views

This paper deals with the problem of makespan minimization in a flow shop with two machines when the input buffer of the second machine can only host a limited number of parts. Here we analyze the problem in the context of batch processing, i.e., when identical parts must be processed consecutively.

An improved algorithm for the distance c

An improved algorithm for the distance constrained p-center location problem with mutual communication on tree networks

✍ Arie Tamir 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 66 KB 👁 1 views