✦ LIBER ✦

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || Contraction of Timetable Networks with Realistic Transfers

✍ Scribed by Festa, Paola

Book ID: 120357258
Publisher: Springer Berlin Heidelberg
Year: 2010
Weight: 191 KB
Category: Article
ISBN: 364213193X
DOI: 10.1007/978-3-642-13193-6_7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || Modularity-Driven Clustering of Dynamic Graphs

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 421 KB

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 218 KB

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || A Metaheuristic for a Two Echelon Location-Routing Problem

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 248 KB

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6049 || A Branch-and-Price Algorithm for Multi-mode Resource Leveling

✍ Festa, Paola 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 227 KB

[Lecture Notes in Computer Science] Comb

[Lecture Notes in Computer Science] Combinatorial Algorithms Volume 5874 || Evaluation of Recoverable-Robust Timetables on Tree Networks

✍ Fiala, Jiří; Kratochvíl, Jan; Miller, Mirka 📂 Article 📅 2009 🏛 Springer Berlin Heidelberg ⚖ 265 KB

[Lecture Notes in Computer Science] Expe

[Lecture Notes in Computer Science] Experimental Algorithms Volume 6630 || Efficient Routing in Road Networks with Turn Costs

✍ Pardalos, Panos M.; Rebennack, Steffen 📂 Article 📅 2011 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 185 KB

This volume constitutes the refereed proceedings of the 10th International Symposium on Experimental Algorithms, SEA 2011, held in Kolimpari, Chania, Crete, Greece, in May 2011. The 36 revised full papers presented together with 2 invited papers were carefully reviewed and selected from 83 submissio