✦ LIBER ✦

A polynomial time approximation algorithm for the two-commodity splittable flow problem

✍ Scribed by Elke Eisenschmidt, Utz-Uwe Haus

Book ID: 120744719
Publisher: Springer
Year: 2012
Tongue: English
Weight: 305 KB
Volume: 77
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s00186-012-0402-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Comparing branch-and-price algorithms fo

Comparing branch-and-price algorithms for the Multi-Commodity k-splittable Maximum Flow Problem

✍ M. Gamst; B. Petersen 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 246 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the two-stage multiprocessor flow shop problem

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 148 KB

In this paper we investigate the two-stage multiprocessor ow shop scheduling problem F2(P)| • |Cmax, where the numbers m1 and m2 of machines available in the two stages are part of the input. We demonstrate the existence of a polynomial time approximation scheme for this problem. This result solves

A local search heuristic for the Multi-C

A local search heuristic for the Multi-Commodity(k)-splittable Maximum Flow Problem

✍ M. Gamst 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 640 KB

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

A Branch and Price algorithm for the -sp

A Branch and Price algorithm for the -splittable maximum flow problem

✍ Jérôme Truffot; Christophe Duhamel 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 805 KB

A polynomial-time algorithm for a flow-s

A polynomial-time algorithm for a flow-shop batching problem with

✍ Peter Brucker; Natalia V. Shakhlevich 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 691 KB