✦ LIBER ✦

An exact approach for the maximum concurrentk-splittable flow problem

✍ Scribed by Massimiliano Caramia; Antonino Sgalambro

Publisher: Springer-Verlag
Year: 2007
Tongue: English
Weight: 257 KB
Volume: 2
Category: Article
ISSN: 1862-4472
DOI: 10.1007/s11590-007-0055-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast heuristic algorithm for the maxim

A fast heuristic algorithm for the maximum concurrentk-splittable flow problem

✍ Massimiliano Caramia; Antonino Sgalambro 📂 Article 📅 2009 🏛 Springer-Verlag 🌐 English ⚖ 300 KB

An exact algorithm for the maximum cliqu

An exact algorithm for the maximum clique problem

✍ Randy Carraghan; Panos M. Pardalos 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 358 KB

An exact algorithm for the maximum stabl

An exact algorithm for the maximum stable set problem

✍ Carlo Mannino; Antonio Sassano 📂 Article 📅 1994 🏛 Springer US 🌐 English ⚖ 795 KB

An approach for the network flow problem

An approach for the network flow problem with multiple objectives

✍ Herminia I. Calvete; Pedro M. Mateo 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 814 KB

An elementary approach to the analysis o

An elementary approach to the analysis of exact solutions for the Navier-Stokes stagnation flows with slips

✍ N. Ishimura; T. K. Ushijima 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 536 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.