Technical Report Library

Sorted by: Technical Report Number
Return to main page

242 TRs in this category.
Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-linear Objectives with Applications
George Tsaggouris and Christos Zaroliagis
Theory of Computing Systems, 2008, to appear
[ ARRIVAL-TR-0001.pdf, details ]
Mixed-Integer Cuts from Cyclic Groups
Matteo Fischetti and Cristiano Saturni
Mathematical Programming A, Digital Object Identifier (DOI) 10.1007/s10107–006–0726–4, 2006
[ ARRIVAL-TR-0002.pdf, details ]
How tight is the corner relaxation?
M. Fischetti, M. Monaci
to appear in Discrete Optimization, 2007
[ ARRIVAL-TR-0003.pdf, details ]
Projected Chvatal-Gomory cuts for Mixed Integer Linear Programs
P. Bonami, G. Cornuejols, S. Dash, M. Fischetti, A. Lodi
Matematical Programming A, DOI 10.1007/s10107–006–0051-y, 2006
[ ARRIVAL-TR-0004.pdf, details ]
MIPping closures: an instant survey
M. Fischetti, A. Lodi
Graphs and Combinatorics 23, 133–243, 2007.
[ ARRIVAL-TR-0005.pdf, details ]
Repairing MIP infeasibility through Local Branching
M. Fischetti, A. Lodi
Computers and Operations Research 35, 1436–1445, 2007
[ ARRIVAL-TR-0006.pdf, details ]
Distributed Models in Railway Industry
M. Abril, M. A. Salido, F. Barber, L. Ingolotti, A. Lova, P. Tormos
Proc. of the 1st Workshop on Industrial Applications of Distributed Intelligent Systems (INADIS’2006), 2006. CD-ROM. ISBN 85–87837–11–7
[ ARRIVAL-TR-0007.pdf, details ]
A Decision Support System for Railway Timetabling (MOM): The Spanish Case
Federico Barber, Pilar Tormos, Antonio Lova, Laura Ingolotti, Miguel Angel Salido, Montserrat Abril
Computers in Railways X: Computer System Design and Operation in the Railway and Other Transit Systems. (COMPRAIL 2006). ISBN 1–84564–177–9
[ ARRIVAL-TR-0008.pdf, details ]
Distributed constraint satisfaction problems to model railway scheduling problems
P. Tormos, M. Abril, M. A. Salido, F. Barber, L. Ingolotti, A. Lova
Computers in Railways X: Computer System Design and Operation in the Railway and Other Transit Systems. (COMPRAIL 2006). ISBN 1–84564–177–9
[ ARRIVAL-TR-0009.pdf, details ]
A rolling stock circulation model for combining and splitting of passenger trains
Pieter-Jan Fioole, Leo Kroon, Gabor Maroti, Alexander Schrijver
 
[ ARRIVAL-TR-0010.pdf, details ]
Highway Hierarchies Star
Daniel Delling, Peter Sanders, Dominik Schultes, and Dorothea Wagner
9th DIMACS Challenge on Shortest Paths
[ ARRIVAL-TR-0011.pdf, details ]
High-Performance Multi-Level Graphs
Daniel Delling, Martin Holzer, Kirill Müller, Frank Schulz, and Dorothea Wagner
9th DIMACS Challenge on Shortest Paths
[ ARRIVAL-TR-0012.pdf, details ]
Combining Speed-up Techniques for Shortest-Path Computations
Martin Holzer, Frank Schulz, Dorothea Wagner, and Thomes Willhalm
ACM Journal of Experimental Algorithmics
[ ARRIVAL-TR-0013.pdf, details ]
A Game-Theoretic Approach to Line Planning
Anita Schoebel, Silvia Schwarze
Proc.6th Workshop on Algorithmic Methods and Models for Optimization of Railways - ATMOS 2006
[ ARRIVAL-TR-0014.pdf, details ]
Timetable Information: Models and Algorithms
Matthias Müller-Hannemann, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis
Algorithmic Methods for Railway Optimization, Springer
[ ARRIVAL-TR-0015.pdf, details ]
A Class of Infinite Potential Games
Justo Puerto, Anita Schoebel and Silvia Schwarze
accepted for publication by Mathematical Methods of Operations Research, to appear 2008
[ ARRIVAL-TR-0016.pdf, details ]
Capacity Constraints in Delay Management
Anita Schöbel
proceedings of IAROR'07, ISBN 978–90–78271–02–4
[ ARRIVAL-TR-0017.pdf, details ]
Integer programming approaches for solving the delay management problem
Anita Schöbel
Lecture Notes on Computer Science 4359, Springer, pp. 145–170, 2007
[ ARRIVAL-TR-0018.pdf, details ]
Track assignment
Sabine Cornelsen and Gabriele Di Stefano
Journal of Discrete Algorithms, 5(2):250:261, 2007
[ ARRIVAL-TR-0019.pdf, details ]
On the Implementation of Parallel Shortest Path Algorithms on a Supercomputer
Gabriele Di Stefano, Alberto Petricola, Christos Zaroliagis
ISPA- Dec. '06 - Lecture Notes in Computer Science 4330
[ ARRIVAL-TR-0020.pdf, details ]
Partitioning Graphs to Speed-Up Dijkstra’s Algorithm
Rolf H. Möhring, Heiko Schilling, Birk Schütz, Dorothea Wagner, and Thomas Willhalm
ACM Journal of Experimental Algorithmics
[ ARRIVAL-TR-0021.pdf, details ]
Partially Dynamic Efficient Algorithms for Distributed Shortest Paths
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
An extended abstract of this work will appear in the proceedings of the IEEE International Conference on Computing: Theory and Application (ICCTA'07)
[ ARRIVAL-TR-0022.pdf, details ]
Implementations of routing algorithms for transportation networks
Chris Barrett, Keith Bisset, Martin Holzer, Goran Konjevod, Madhav Marathe, and Dorothea Wagner
Presented at the workshop on the DIMACS Shortest-Path Challenge.
[ ARRIVAL-TR-0023.pdf, details ]
Speed-Up Techniques for Shortest-Path Computations
Dorothea Wagner and Thomas Willhalm
published in Proceedings of STACS 07
[ ARRIVAL-TR-0024.pdf, details ]
Efficient Models for Timetable Information in Public Transportation Systems
Evangelia Pyrga, Frank Schulz, Dorothea Wagner, and Christos Zaroliagis
ACM Journal of Experimental Algorithmics, to appear.
[ ARRIVAL-TR-0025.pdf, details ]
On the Dynamization of Shortest Path Overlay Graphs
Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
 
[ ARRIVAL-TR-0026.pdf, details ]
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
Spyros Kontogiannis, Panagiota Panagopoulou, Paul Spirakis
Proc. 2nd International Workshop on Internet and Network Economics (WINE2006).
[ ARRIVAL-TR-0027.pdf, details ]
On the online track assignment problem
Marc Demange, Gabriele Di Stefano and Benjamin Leroy-Beaulieu
 
[ ARRIVAL-TR-0028.pdf, details ]
Multi-Mode Resource Constrained Project Scheduling: Scheduling Schemes, Priority Rules and Mode Selection Rules
Antonio Lova, Pilar Tormos, Federico Barber
Inteligencia Artificial, Revista Iberoamericana de Inteligencia Artificial. No.30 (2006), pp. 69–86. ISSN: 1137–3601. © AEPIA (http://www.aepia.dsic.upv.es/).
[ ARRIVAL-TR-0029.pdf, details ]
QoS-aware Multicommodity Flows and Transportation Planning
George Tsaggouris and Christos Zaroliagis
Proc.6th Workshop on Algorithmic Methods and Models for Optimization of Railways - ATMOS 2006
[ ARRIVAL-TR-0030.pdf, details ]
Stochastic Improvement of Cyclic Railway Timetables
Leo Kroon, Rommert Dekker, Gabor Maroti, Mathijn Retel Helmrich, and Michiel Vromans
 
[ ARRIVAL-TR-0031.pdf, details ]
Re-scheduling of railway rolling stock during track maintenance
Gabriella Budai, Gabor Maroti, Rommert Dekker, Dennis Huisman, Leo Kroon
 
[ ARRIVAL-TR-0032.pdf, details ]
Using Flow Reliability Conditions in Robust Rapid Transit Network Design
Ángel Marín, Juan A. Mesa, Federico Perea
Submitted
[ ARRIVAL-TR-0033.pdf, details ]
Dynamic Interpolation Search Revisited
Alexis Kaporis, Christos Makris, Spyros Sioutas, Athanasios Tsakalidis, Kostas Tsichlas, and Christos Zaroliagis
In Automata, Languages, and Programming — ICALP 2006, LNCS 4051, Part I (Springer 2006), pp. 382–394.
[ ARRIVAL-TR-0034.pdf, details ]
Passenger Railway Optimization
A. Caprara, L. Kroon, M. Monaci, M. Peeters, P. Toth
 
[ ARRIVAL-TR-0035.pdf, details ]
A Scheduling order-based method to solve timetabling problems
L. Ingolotti, F. Barber, P. Tormos, A. Lova, M.A. Salido, M. Abril
Current Topics in Artidicial Intelligence. Lecture Notes in Artidicial Intelligence 4177, 52—61, May 2006, ISSN 0302–9743
[ ARRIVAL-TR-0036.pdf, details ]
New Heuristics to Solve the CSOP Railway Timetabling Problem
L. Ingolotti, A. Lova, F. Barber, P. Tormos, M. A. Salido, M. Abril
Advances in Applied Artificial Intelligence. Lecture Notes in Artificial Intelligence. Vol 4031, 400—409, June, 2006.
[ ARRIVAL-TR-0037.pdf, details ]
Domain dependent distributed models for railway scheduling
M. A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova
In proc. of 26th SGAI International Conference on Innovative Techniques and Applications of Artificial Intelligence. AI 2006, Vol 14, 163—176.
[ ARRIVAL-TR-0038.pdf, details ]
Distributed models for solving CSPs
M. Abril, M. A. Salido, F. Barber
INFOCOMP. Journal of Computer Science, ISSN 1807–4545, 43—50,2007
[ ARRIVAL-TR-0039.pdf, details ]
Domain-dependent distributed models for railway scheduling
M. A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova
Knowledge Based Systems 20, 186–194, 2007
[ ARRIVAL-TR-0040.pdf, details ]
Shunting of Passenger Train Units: an Integrated Approach
L.G. Kroon, R.M. Lentink, A. Schrijver
Submitted to Transportation Science
[ ARRIVAL-TR-0041.pdf, details ]
Decision Support for Crew Rostering at NS
A. Hartog, D. Huisman, E.J.W. Abbink, and L.G. Kroon
Submitted to: Proceedings of CASPT2006
[ ARRIVAL-TR-0042.pdf, details ]
Disruption Management in Passenger Railway Transportation
J. Jespersen-Groth, D. Potthoff, J. Clausen, D. Huisman, L.G. Kroon, G. Maroti, M. Nyhave Nielsen
Submitted to: Computers and Operations Research
[ ARRIVAL-TR-0043.pdf, details ]
Comparison of heuristic approaches for the multiple depot vehicle scheduling problem
A.-S. Pepin, G. Desaulniers, A. Hertz, D. Huisman
Submitted to: Journal of Scheduling
[ ARRIVAL-TR-0044.pdf, details ]
Optimizing the Cargo Express Service of Swiss Federal Railways
Alberto Ceselli, Michael Gatto, Marco E. Lübbecke, Marc Nunkesser, and Heiko Schilling
Submitted to: Transportation Science
[ ARRIVAL-TR-0045.pdf, details ]
A Column Generation Approach to Train Timetabling on a Corridor
V. Cacchiani, A. Caprara, P. Toth
to appear in 4OR
[ ARRIVAL-TR-0046.pdf, details ]
Solving a Real-World Train Unit Assignment Problem
V. Cacchiani, A. Caprara, P. Toth
presented at the 11th Combinatorial Optimization Workshop 2007
[ ARRIVAL-TR-0047.pdf, details ]
Techniques to Schedule Heterogeneous Railway Traffic
A. Lova, P. Tormos, F. Barber, L. Ingolotti, M. Abril, M. A. Salido
In Proceedings of the XXIX Congreso Nacional de Estadistica e Investigacion Operativa. Pages 633—634. ISBN 84–689–8553–8. 2006
[ ARRIVAL-TR-0048.pdf, details ]
MOM: A Software System to optimize the railway traffic
P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, M.A. Salido
In proceedings of the XXIX Congreso Nacional de Estadistica e Investigacion Operativa. Pages 535—536. ISBN = 84–689–8553–8. 2006
[ ARRIVAL-TR-0049.pdf, details ]
Distributed CSPs by Graph Partitioning
M. A. Salido and F. Barber
Applied Mathematics and Computation, Elsevier. Vol 183 Issue 1. Pages 491—498. December, 2006.
[ ARRIVAL-TR-0050.pdf, details ]
A contribution to the critical analysis and evaluation of existing methods for railway resource (re)scheduling
G. BOUREZ, D. DE ALMEIDA, N. MARCOS and C. WEBER
SNCF Technical Report
[ ARRIVAL-TR-0051.pdf, details ]
A contribution to the critical analysis and evaluation of models and methods for optimizing timetables
G. DESSAGNE and L. GELY
SNCF Technical Report GDA/LG/ARRIVAL/WP31/070122
[ ARRIVAL-TR-0052.pdf, details ]
Rapid Transit Network Robustness Indices: From the Topological to the Operational Viewpoint
Antonio J. Lozano, Juan A. Mesa, Francisco A. Ortega
 
[ ARRIVAL-TR-0053.pdf, details ]
Urban Rapid Transit Network Capacity Expansion
Ángel Marín, Patricia Jaramillo
Submitted to EJOR
[ ARRIVAL-TR-0054.pdf, details ]
Location of infrastructure in Urban Railway Network
Ángel Marín, Ricardo García-Ródenas
Submitted to C&OR
[ ARRIVAL-TR-0055.pdf, details ]
Delay Resistant Timetabling
Christian Liebchen and Sebastian Stiller
Presented at CASPT 2006
[ ARRIVAL-TR-0056.pdf, details ]
The Price of Anarchy of a Network Creation Game with Exponential Payoff
Nadine Baumann and Sebastian Stiller
Accepted to SAGT 08
[ ARRIVAL-TR-0057.pdf, details ]
Algorithmic decision Support for Shunt Planning
Ramon Lentink
PhD Thesis, Erasmus University Rotterdam, 2006
[ ARRIVAL-TR-0058.pdf, details ]
Operations Research Models for Railway Rolling Stock Planning
Gabor Maroti
PhD Thesis, Eindhoven University of Technology, 2006
[ ARRIVAL-TR-0059.pdf, details ]
Efficient Circulation of Railway Rolling Stock
Arianna Alfieri, Rutger Groot, Leo Kroon, Lex Schrijver
 
[ ARRIVAL-TR-0060.pdf, details ]
Identifying dependencies among delays
Carla Conte and Anita Schöbel
proceedings of IAROR'07, ISBN 978–90–78271–02–4
[ ARRIVAL-TR-0061.pdf, details ]
On Robust Online Job Shop Scheduling
Michael Gatto, Peter Widmayer
 
[ ARRIVAL-TR-0062.pdf, details ]
A New Bound on the Length of Minimum Cycle Bases
Romeo Rizzi and Christian Liebchen
 
[ ARRIVAL-TR-0063.pdf, details ]
Benchmarks for Strictly Fundamental Cycle Bases
Christian Liebchen, Gregor Wünsch, Ekkehard Köhler, Alexander Reich, and Romeo Rizzi
accepted for publication in Proceedings of WEA 2007
[ ARRIVAL-TR-0064.pdf, details ]
To wait or not to wait? The bicriteria delay management problem in public transportation
Andreas Ginkel, Anita Schöbel
Transportation Science 41(4), pp. 527–538, 2007
[ ARRIVAL-TR-0065.pdf, details ]
Recoverable Robustness
Christian Liebchen, Marco Lübbecke, Rolf H. Möhring, Sebastian Stiller
 
[ ARRIVAL-TR-0066.pdf, details ]
The Maximum Capacity of a Line Plan is Inapproximable
Christina Puhl, Sebastian Stiller
submitted
[ ARRIVAL-TR-0067.pdf, details ]
An adversarial queueing model for online server routing
Vincenzo Bonifaci
Theoretical Computer Science, 381(1–3), pp. 280–287, 2007.
[ ARRIVAL-TR-0068.pdf, details ]
Computational Game Theory: An Introduction
Paul G. Spirakis and Panagiota N. Panagopoulou
To appear as a chapter in "Algorithms and Theory of Computation Handbook"
[ ARRIVAL-TR-0069.pdf, details ]
Algorithms for Delay Management with Capacity Constraints
Michael Schachtebeck and Anita Schöbel
 
[ ARRIVAL-TR-0070.pdf, details ]
Computing Delay Resistant Railway Timetables
Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, Andre Prigge
 
[ ARRIVAL-TR-0071.pdf, details ]
Robust Algorithms and Price of Robustness in Shunting Problems
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
to appear in ATMOS 2007 proceedings
[ ARRIVAL-TR-0072.pdf, details ]
Combinatorial Aspects of Move-Up Crews
Holger Flier, Abhishek Gaurav, and Marc Nunkesser
to appear in Operations Research Proceedings 2008
[ ARRIVAL-TR-0073.pdf, details ]
An Efficient Adaptive Heuristic for the Resource Constrained Project Scheduling Problem
A. Lova, P. Tormos, M.Cervantes, F. Barber
XII Conferencia de la Asociación Española para la Inteligencia Artificial. (To appear)
[ ARRIVAL-TR-0074.pdf, details ]
Shortest-Path Indices: Establishing a Methodology for Shortest-Path Problems
Reinhard Bauer, Daniel Delling and Dorothea Wagner
 
[ ARRIVAL-TR-0075.pdf, details ]
Application of Meta-Tree-Based Distributed Search to the Railway Scheduling Problem
M. Abril, M.A. Salido, F. Barber
Proceedings Workshop: Constraint SatisfactionTechniques for Planning and Scheduling Problems (ICAPS), 6—13, 2007.
[ ARRIVAL-TR-0076.pdf, details ]
Domain Dependent Distributed Models for Railway Scheduling
M. A. Salido, M. Abril, F. Barber, L. Ingolotti, P. Tormos, A. Lova
Journal Knowledge Based Systems (Elsevier) vol 20, 186—194, 2007.
[ ARRIVAL-TR-0077.pdf, details ]
SHARC: Fast and Robust Unidirectional Routing
Reinhard Bauer and Daniel Delling
to appear in the Proceedings of ALENEX'08
[ ARRIVAL-TR-0078.pdf, details ]
DFS-Tree Based Heuristic Search
M. Abril, M. A. Salido, F.Barber
7th Symposium on Abstraction, Reformulation and Abstraction (SARA’07). LNCS vol 4612, 6—19
[ ARRIVAL-TR-0079.pdf, details ]
A non-binary constraint ordering heuristic for constraint satisfaction problems
M.A. Salido
Applied Mathematics and Computation, DOI: 10.1016/j.amc.2007.08.064.To appear, (2007)
[ ARRIVAL-TR-0080.pdf, details ]
A Genetic Algorithm for Railway Scheduling Problems
P. Tormos, A. Lova, F. Barber, L. Ingolotti, M. Abril, and M.A. Salido
Chapter 10 in Metaheuristics for Scheduling In Industrial and Manufacturing Applications (Springer Series in Computational Intelligence)
[ ARRIVAL-TR-0081.pdf, details ]
An Assessment of Railway Capacity
M. Abril, F. Barber, L. Ingolotti, M.A. Salido, P. Tormos, A. Lova
Transportation Research Part E: Logistics and Transportation Review. ISSN: 1366–5545
[ ARRIVAL-TR-0082.pdf, details ]
Nogood-FC for Solving Partitionable Constraint Satisfaction Problems
M. Abril, M. A. Salido and F. Barber
Workshop on Planning, Scheduling and Constraint Satisfaction (Caepia 2007), 115—127, ISBN-13: 978–84–611–8860–4.
[ ARRIVAL-TR-0083.pdf, details ]
Partition and Multivariable Distributed Resolution of Constraint Satisfaction Problems (in Spanish)
M. Abril, F. Barber, M. A. Salido
PhD Thesis, Universidad Politecnica de Valencia, 2007.
[ ARRIVAL-TR-0084.pdf, details ]
Models and Methods for Optimization and Efficiency Improvement of Train Timetabling Problems (in Spanish)
L. Ingolotti, F. Barber, P. Tormos
PhD Thesis, Universidad Politecnica de Valencia, 2007.
[ ARRIVAL-TR-0085.pdf, details ]
Intelligent Train Scheduling on a High-Loaded Railway Network
A. Lova, P. Tormos, F. Barber, L. Ingolotti, M. A. Salido, M. Abril
Selected Articles from Atmos 2004. Railway Optimization 2004, LNCS 4359, 219—232,2007.
[ ARRIVAL-TR-0086.pdf, details ]
Bincoloring
Sven O. Krumke, Willem.E. de Paepe, Joerg Rambau, Leen Stougie
Technical report TU Eindhoven http://www.win.tue.nl/math/bs/spor/2007-04.pdf
[ ARRIVAL-TR-0087.pdf, details ]
Dynamic Multi-level Overlay Graphs for Shortest Paths
Francesco Bruera, Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni
Journal of Mathematics in Computer Science, special issue on Combinatorial Algorithms. An extended abstract of this paper appears in the Proceedings of ATMOS07.
[ ARRIVAL-TR-0088.pdf, details ]
Models for Rearranging Train Cars
Gabriele Di Stefano, Jens Maue, Maciej Modelski, Alfredo Navarra, Marc Nunkesser, John van den Broek
 
[ ARRIVAL-TR-0089.pdf, details ]
Landmark-Based Routing in Dynamic Graphs
Daniel Delling and Dorothea Wagner
published in the Proceedings of WEA'07
[ ARRIVAL-TR-0090.pdf, details ]
Experimental Study on Speed-Up Techniques for Timetable Information Systems
Reinhard Bauer, Daniel Delling and Dorothea Wagner
published in the Proceedings of ATMOS'07
[ ARRIVAL-TR-0091.pdf, details ]
Partially Dynamic Algorithms for Distributed Shortest Paths and their Experimental Evaluation
Serafino Cicerone, Gianlorenzo D’Angelo, Gabriele Di Stefano, Daniele Frigioni, Alberto Petricola
Journal of Computers
[ ARRIVAL-TR-0092.pdf, details ]
A Local Dominance Procedure for Mixed-Integer Linear Programming
Matteo Fischetti and Domenico Salvagnin
 
[ ARRIVAL-TR-0093.pdf, details ]
Fast Approaches to Improve the Robustness of a Railway Timetable
Matteo Fischetti and Domenico Salvagnin and Arrigo Zanette
 
[ ARRIVAL-TR-0094.pdf, details ]
Stop Location Design in Public Transportation Networks: Covering and Accessibility Objectives
Dwi R. Poetranto, H.W. Hamacher, S. Horn, A. Schöbel
 
[ ARRIVAL-TR-0095.pdf, details ]
Integrating Line Planning, Timetabling, and Vehicle Scheduling: A customer-oriented approach
Mathias Michaelis and Anita Schöbel
 
[ ARRIVAL-TR-0096.pdf, details ]
Online Delay Management: PSPACE hardness and Simulation
Andre Berger, Ralf Hoffmann, Ulf Lorenz, Sebastian Stiller
Submitted to SIMUTools 2008
[ ARRIVAL-TR-0097.pdf, details ]
A linear bound on the diameter of the transportation polytope
G. Brightwell, J. van den Heuvel, L. Stougie
Combinatorica 26, 2006, 133–139
[ ARRIVAL-TR-0098.pdf, details ]
The generalized two-server problem
R. Sitters, L. Stougie
Journal of the ACM 53, 2006, 1—22
[ ARRIVAL-TR-0099.pdf, details ]
Simple Integer Recourse Models: Convexity and Convex Approximations
W.K. Klein Haneveld, L. Stougie, M.H. van der Vlerk
Mathematical Programming, Series B 108, 2006, 435—474
[ ARRIVAL-TR-0100.pdf, details ]
Prefix reversals on binary and ternary strings
Cor Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp
SIAM Journal on Discrete Mathematics 21, 2007, 592–611
[ ARRIVAL-TR-0101.pdf, details ]
Computational complexity of stochastic programming problems
M.E. Dyer, L. Stougie
Mathematical Programming 106, 2006, 423—432
[ ARRIVAL-TR-0102.pdf, details ]
A linear programming formulation of Mader's edge-disjoint paths problem
J.C.M. Keijsper, R.A. Pendavingh, L. Stougie
Journal of Combinatorial Theory, Series B 96, 2006, 159—163
[ ARRIVAL-TR-0103.pdf, details ]
Location of slaughterhouses under economies of scale
J.J.J. van den Broek, P. Schütz, L. Stougie, A. Tomasgard
European Journal on Operational Research 175, 2006, 740—750
[ ARRIVAL-TR-0104.pdf, details ]
Latency Constrained Aggregation in Sensor Networks
L. Becchetti, P. Korteweg, A. Marchetti-Spaccamela, M. Skutella, L. Stougie, A. Vitaletti
Proceedings of the 14th European Symposium on Algorithms (ESA), Zuerich, Switzerland, 2006, Lecture Notes in Computer Science 4168, Springer Verlag, Berlin, 2006, 88—99
[ ARRIVAL-TR-0105.pdf, details ]
An approximation algorithm for the Wireless Gathering Problem
V. Bonifaci, P. Korteweg, A. Marchetti Spaccamela, L. Stougie
Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT), Riga, Latvia, 2006, Lecture Notes in Computer Science 4059, Springer Verlag, Berlin, 2006, 328—338
[ ARRIVAL-TR-0106.pdf, details ]
Online k-server routing problems
V. Bonifaci, L. Stougie
In Proc. 4th Workshop on Approximation and Online Algorithms. To appear in Theory of Computing Systems.
[ ARRIVAL-TR-0107.pdf, details ]
Data Aggregation in Sensor Networks: Balancing Communication and Delay Costs
P. Korteweg, A. Marchetti-Spaccamela, L. Stougie, A. Vitaletti
Proceedings of the 14th Colloquium on Structural Information and Communication Complexity Workshop (SIROCCO), Castiglioncello, Italy, June 5—8, 2007, Lecture Notes in Computer Science 4474, Springer, Berlin, 2007, 135—146
[ ARRIVAL-TR-0108.pdf, details ]
Virtual private network design : a proof of the tree routing conjecture on ring networks
Hurkens, C.A.J., Keijsper, J.C.M., Stougie, L.
SIAM Journal on Discrete Mathematics 21, 2007, 482–503
[ ARRIVAL-TR-0109.pdf, details ]
Path Player Games: Analysis, Generalization and Application
Silvia Schwarze
 
[ ARRIVAL-TR-0110.pdf, details ]
Rolling Stock Planning: Adapting the Composition Model to the Operational Planning Phase
Wouter Mieras
 
[ ARRIVAL-TR-0111.pdf, details ]
A new Heuristic for Job Shops with No-Wait and Blocking Constraints
John van den Broek and Cor Hurkens
 
[ ARRIVAL-TR-0112.pdf, details ]
Absorption Robustness of Railway Resource Schedules
Lars Kjær Nielsen, Leo Kroon, Gabor Maroti
 
[ ARRIVAL-TR-0113.pdf, details ]
When Periodic Timetables are Suboptimal
Ralf Borndörfer and Christian Liebchen
To appear in OR Proceedings 2007
[ ARRIVAL-TR-0114.pdf, details ]
New Length Bounds for Cycle Bases
Michael Elkin, Christian Liebchen, and Romeo Rizzi
Information Processing Letters 104 (5), pages 186–193
[ ARRIVAL-TR-0115.pdf, details ]
On the interaction between robust timetable planning and delay management
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
COCOA 2008
[ ARRIVAL-TR-0116.pdf, details ]
The Complexity of the Shortcut Problem
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
 
[ ARRIVAL-TR-0117.pdf, details ]
Delay Management with Restricted Adversaries and Ski Rental
Michael Gatto, Marc Nunkesser, Anita Schöbel, Peter Widmayer
 
[ ARRIVAL-TR-0118.pdf, details ]
Light Robustness
Matteo Fischetti and Michele Monaci
 
[ ARRIVAL-TR-0119.pdf, details ]
Re-scheduling in railways: the Rolling Stock Balancing Problem
Gabriella Budai, Gabor Maroti, Rommert Dekker, Dennis Huisman, Leo Kroon
 
[ ARRIVAL-TR-0120.pdf, details ]
Price of Recoverability for Railway Rolling Stock Planning
Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo Kroon, Gabor Maroti, Paolo Toth
 
[ ARRIVAL-TR-0121.pdf, details ]
Move-up Train Units
Valentina Cacchiani, Alberto Caprara, Leo Kroon, Gabor Maroti, Paolo Toth
 
[ ARRIVAL-TR-0122.pdf, details ]
Robust Train Routing
Leo Kroon, Gabor Maroti
 
[ ARRIVAL-TR-0123.pdf, details ]
Can pure cutting plane algorithms work?
Arrigo Zanette, Matteo Fischetti and Egon Balas
 
[ ARRIVAL-TR-0124.pdf, details ]
Robustness in Railway Timetabling (in spanish)
Salido, M. A. and Tarazona, S.
In Proc. of the 2st Workshop on Industrial Applications of Distributed Intelligent Systems (INADIS 2007), 2007.
[ ARRIVAL-TR-0125.pdf, details ]
Freight Transportation in Railway Networks
V. Cacchiani, A. Caprara, P. Toth
 
[ ARRIVAL-TR-0126.pdf, details ]
Minimizing Flow Time in the Wireless Gathering Problem
V. Bonifaci, P.Korteweg, A. Marchetti Spaccamela, L. Stougie
STACS 2008
[ ARRIVAL-TR-0127.pdf, details ]
The Distributed Wireless Gathering Problem
V. Bonifaci, P.Korteweg, A. Marchetti Spaccamela, L. Stougie
AAIM 2008
[ ARRIVAL-TR-0128.pdf, details ]
Robustness of Rolling Stock Schedules
D. DE ALMEIDA, N. MARCOS, S. VIANEY and C. WEBER
SNCF Technical Report GDA/DDA/ARRIVAL/WP43/080121
[ ARRIVAL-TR-0129.pdf, details ]
Dynamic Algorithms for Recoverable Robustness Problems
Serafino Cicerone, Gabriele Di Stefano, Michael Schachtebeck, Anita Schöbel
Presented at ATMOS'08
[ ARRIVAL-TR-0130.pdf, details ]
On the Impact of Uncertainty on some Optimization Problems: Combinatorial Aspects of Delay Management and Robust Online Scheduling
Michael Gatto
PhD Thesis No. 17452, ETH Zurich, 2007.
[ ARRIVAL-TR-0131.pdf, details ]
Integrating Rolling Stock Circulation into the Delay Management Problem
Holger Flier, Marc Nunkesser, Michael Schachtebeck, Anita Schöbel
 
[ ARRIVAL-TR-0132.pdf, details ]
Timetable Information Updating in Case of Delays: Modeling Issues
Daniel Delling, Kalliopi Giannakopoulou, Dorothea Wagner, and Christos Zaroliagis
 
[ ARRIVAL-TR-0133.pdf, details ]
Well Supported Approximate Equilibria in Bimatrix Games: A
Spyros Kontogiannis and Paul Spirakis
Appeared in the 32nd International Symposium on athematical Foundations of Computer Science (MFCS 2007)
[ ARRIVAL-TR-0134.pdf, details ]
Atomic Congestion Games: Fast, myopic and concurrent
Dimitris Fotakis, Alexis Kaporis, Paul Spirakis
To appear in the 1st International Symposium on Algorithmic Game Theory (SAGT 2008)
[ ARRIVAL-TR-0135.pdf, details ]
Robust Line Planning through Elasticity of Frequencies
Spyros Kontogiannis and Christos Zaroliagis
 
[ ARRIVAL-TR-0136.pdf, details ]
Solving Large Scale Crew Scheduling Problems by Using Iterative Partitioning
Erwin Abbink, Joel van't Wout and Dennis Huisman
ATMOS 2007
[ ARRIVAL-TR-0137.pdf, details ]
Maintenance Routing for Train Units: the Interchange Model
Gabor Maroti, Leo Kroon
 
[ ARRIVAL-TR-0138.pdf, details ]
Online Bounded Coloring of Permutation and Overlap Graphs
Marc Demange, Gabriele Di Stefano, Benjamin Leroy-Beaulieu
Electronic Notes in Discrete Matematics. To appear.
[ ARRIVAL-TR-0139.pdf, details ]
Multistage Methods for Freight Train Classification
Riko Jacob, Peter Marton, Jens Maue, and Marc Nunkesser
ATMOS 2007
[ ARRIVAL-TR-0140.pdf, details ]
A capacity test for shunting movements
J.J.J. van den Broek and L.G. Kroon
 
[ ARRIVAL-TR-0141.pdf, details ]
A column generation approach for the rail crew re-scheduling problem
Dennis Huisman
 
[ ARRIVAL-TR-0142.pdf, details ]
Developing a measure for robustness for crew schedules of Netherlands Railways
Chrissy Tan
 
[ ARRIVAL-TR-0143.pdf, details ]
Contracting Timetable Information Networks
Daniel Delling, Kalliopi Giannakopoulou, Dorothea Wagner, and Christos Zaroliagis
 
[ ARRIVAL-TR-0144.pdf, details ]
Algorithmic Methods for Railway Optimization
Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagis (editors)
LNCS volume 4359
[ ARRIVAL-TR-0145.pdf, details ]
Solution of the Train Platforming Problem
A. Caprara, L. Galli, P. Toth
ATMOS 2007
[ ARRIVAL-TR-0146.pdf, details ]
A new concept of robustness
Ricardo Garcia, Angel Marin, Juan A. Mesa, Doroteo Verastegui, Federico Perea
ATMOS 2007
[ ARRIVAL-TR-0147.pdf, details ]
The Maximum Trip Covering Location Problem with an Alternative Mode of Transportation
Mark Körner, Juan A. Mesa, Federico Perea, Anita Schöbel, Daniel Scholz
 
[ ARRIVAL-TR-0148.pdf, details ]
Distributed Search in Railway Scheduling Problems
M. Abril, M. A. Salido, F. Barber
Engineering Application of Artificial Intelligence (elsevier), Vol.21, No.5 (2008)
[ ARRIVAL-TR-0149.pdf, details ]
A Hybrid Genetic Algorithm for the Multi-Mode Resource Constrained Project Scheduling Problem
A. Lova, P. Tormos, M. Cervantes, F. Barber
11th Workshop on Project Management and Scheduling, Instambul 2008
[ ARRIVAL-TR-0150.pdf, details ]
Integrating timetabling, network and line design
F, Barber, L. Ingolotti, A. Lova, A. Marin, J. Mesa, F. Ortega, F. Perea, P. Tormos
 
[ ARRIVAL-TR-0151.pdf, details ]
Designing Robust Rapid Transit Networks with Alternative Routes
G, Laporte, A. Marin, J. A. Mesa, F. Perea
to appear in Journal of Advanced Transportation
[ ARRIVAL-TR-0152.pdf, details ]
Solutions to real-world instances of PSPACE-complete stacking.
F.G.König, M.E.Lübbecke, R.H.Möhring, G.Schäfer, and I.Spenke.
In Proceedings of the 15th European Symposium on Algorithms (ESA)
[ ARRIVAL-TR-0153.pdf, details ]
Linien-, Fahrplan-, Umlauf- und Dienstplanoptimierung: Wie weit können diese bereits integriert werden?
Christian Liebchen
HEUREKA 2008 Tagungsbericht
[ ARRIVAL-TR-0154.pdf, details ]
Budgeted matching and budgeted matroid intersection via the gasoline puzzle
A. Berger, V. Bonifaci, F. Grandoni, G. Schäfer
IPCO 2008
[ ARRIVAL-TR-0155.pdf, details ]
Anschlüsse, Bahnhöfe, Fahrpreise: Diskrete Optimierung im öffentlichen Verkehr
Anita Schöbel
Heureka, 2008
[ ARRIVAL-TR-0156.pdf, details ]
Recoverable-Robust Platforming by Network Buffering
Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth
 
[ ARRIVAL-TR-0157.pdf, details ]
A Decision Support Framework for Rolling Stock Rescheduling
Lars Kjær Nielsen
Submitted to and winner of 2008 INFORMS Railway Applications Section Student Paper Contest
[ ARRIVAL-TR-0158.pdf, details ]
A constant-approximate feasibility test for multiprocessor real-time scheduling
V. Bonifaci, A. Marchetti Spaccamela, S. Stiller
ESA 2008
[ ARRIVAL-TR-0159.pdf, details ]
Minimizing average flow time in sensor data gathering
V. Bonifaci, P.Korteweg, A. Marchetti Spaccamela, L. Stougie
ALGOSENSORS 2008
[ ARRIVAL-TR-0160.pdf, details ]
Stackelberg routing in arbitrary networks
V. Bonifaci, T. Harks, G. Schäfer
WINE 2008, INOC 2009
[ ARRIVAL-TR-0161.pdf, details ]
Robustness by cutting planes and the Uncertain Set Covering Problem
Matteo Fischetti, Michele Monaci
 
[ ARRIVAL-TR-0162.pdf, details ]
Recoverable Robust Timetables on Trees
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
 
[ ARRIVAL-TR-0163.pdf, details ]
Planning Additional Trains on Corridors
Holger Flier, Thomas Graffagnino, and Marc Nunkesser
SEA 2009
[ ARRIVAL-TR-0164.pdf, details ]
Feasibility Pump 2.0
Matteo Fischetti and Domenico Salvagnin
 
[ ARRIVAL-TR-0165.pdf, details ]
Just MIP it!
Matteo Fischetti, Andrea Lodi and Domenico Salvagnin
 
[ ARRIVAL-TR-0166.pdf, details ]
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
Vincenzo Bonifaci, Alberto Marchetti-Spaccamela, Sebastian Stiller
ESA 2008
[ ARRIVAL-TR-0167.pdf, details ]
A Dynamic Population Steady-State Genetic Algorithm for the Resource-Constrained Project Scheduling Problem
M. Cervantes, A. Lova, P. Tormos and F. Barber
IEA/AIE 2008. Lecture Notes in Artificial Intelligence 5027, 611—620, 2008, ISBN 978–3−540–69045–0
[ ARRIVAL-TR-0168.pdf, details ]
A Hybrid Genetic Algorithm for the Multi-Mode Resource Constrained Project Scheduling Problem
A. Lova, P. Tormos, M. Cervantes and F. Barber
Proceedings of the Eleventh International Workshop on Project Management and Scheduling.
[ ARRIVAL-TR-0169.pdf, details ]
An efficient hybrid genetic algorithm for scheduling projects with resource constraints and multiple execution modes
A. Lova, P. Tormos, M. Cervantes and F. Barber
International Journal of Production Economics: Manufacturing Systems, Strategy and Design, Digital Object Identifier (DOI) 10.1016/j.ijpe.2008.11.002, 2008
[ ARRIVAL-TR-0170.pdf, details ]
A Game Theory Framework for the Robust Transportation Network Design Problem
Gilbert Laporte, Juan A. Mesa, Federico Perea
Submitted to Transportation Research B
[ ARRIVAL-TR-0171.pdf, details ]
Recoverable Robust Timetabling: Complexity Results and Algorithms
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra
 
[ ARRIVAL-TR-0172.pdf, details ]
A Genetic approach to Robust Train Timetabling
P. Tormos, A. Lova, L. Ingolotti, F. Barber
 
[ ARRIVAL-TR-0173.pdf, details ]
Minimizing average flow time in sensor data gathering
V. Bonifaci, P. Korteweg, A. Marchetti Spaccamela, L. Stougie
ALGOSENSORS 2008
[ ARRIVAL-TR-0174.pdf, details ]
An approximation algorithm for the wireless gathering problem
V. Bonifaci, P. Korteweg, A. Marchetti Spaccamela, L. Stougie
Operations Research Letters 36(5):605—608, 2008
[ ARRIVAL-TR-0175.pdf, details ]
A tool for drawing timetable graphs
Francis Sourd
SNCF Technical report
[ ARRIVAL-TR-0176.pdf, details ]
A multi scalable model based on a connexity graph representation
L. Gely,, G. Dessagne, P. Pesneau and F. Vanderbeck
COMPRAIL 2008
[ ARRIVAL-TR-0177.pdf, details ]
A cooperative framework between optimization and simulation to adress on-line re-scheduling problems
L. Gely, D. Feillee and G. Dessagne
IAROR - RailZurich2009
[ ARRIVAL-TR-0178.pdf, details ]
Dispatching independent railway simulations with DIRS: a simple RSH-based tool
D. Feillee, G. Dessagne and D. Hill
ESM 2008
[ ARRIVAL-TR-0179.pdf, details ]
Recoverable-Robust Timetables for Trains on Single-Line Corridors
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra
RailZurich2009
[ ARRIVAL-TR-0180.pdf, details ]
Treelike Comparability Graphs
Sabine Cornelsen and Gabriele Di Stefano
Discrete Applied Mathematics, 2009. To appear.
[ ARRIVAL-TR-0181.pdf, details ]
Distance-Hereditary Comparability Graphs
Gabriele Di Stefano
 
[ ARRIVAL-TR-0182.pdf, details ]
CIRCULATION OF RAILWAY ROLLING STOCK: A BRANCH-AND-PRICE APPROACH
Marc Peeters and Leo Kroon
Computers and Operations Research
[ ARRIVAL-TR-0183.pdf, details ]
Evaluation of Computational Methods for Freight Train Classification Schedules
Jens Maue, Marc Nunkesser
 
[ ARRIVAL-TR-0184.pdf, details ]
Evaluation of the robustness of rolling stock schedules
D. De Almeida, C. Rovetta and F. Sourd
SNCF Technical Report GDA/DDA/ARRIVAL/WP44/8406080807
[ ARRIVAL-TR-0185.pdf, details ]
Recoverable Robustness for Railway Rolling Stock Planning
Valentina Cacchiani, Alberto Caprara, Laura Galli, Leo Kroon, Gabor Maroti, Paolo Toth
 
[ ARRIVAL-TR-0186.pdf, details ]
The hardness of train arrangements
C. Eggermont, C. Hurkens, G. Woeginger, M. Modelski
to appear in Operations Research Letters (2009)
[ ARRIVAL-TR-0187.pdf, details ]
A Branch & Bound Algorithm for Job Shops with No-wait and Blocking Precedence Constraints
J.J.J. van den Broek and C.A.J. Hurkens
 
[ ARRIVAL-TR-0188.pdf, details ]
A bicriteria approach for robust timetabling
Anita Schoebel and Albrecht Kratz
 
[ ARRIVAL-TR-0189.pdf, details ]
Recoverable Robustness in Shunting and Timetabling
Serafino Cicerone, Gianlorenzo D'Angelo, Gabriele Di Stefano, Daniele Frigioni, Alfredo Navarra, Michael Schachtebeck, Anita Schöbel
submitted to: Special Volume on Robust an Online Large-Scale Optimization
[ ARRIVAL-TR-0190.pdf, details ]
IP-based Techniques for Delay Management with Priority Decisions
Michael Schachtebeck, Anita Schöbel
in: Proceedings of the 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems (ATMOS08)
[ ARRIVAL-TR-0191.pdf, details ]
On Fault-Tolerant Facility Location
Jaroslaw Byrka, Aravind Srinivasan, Chaitanya Swamy
 
[ ARRIVAL-TR-0192.pdf, details ]
Approximation algorithms for stochastic and risk-averse optimization
Jaroslaw Byrka, Aravind Srinivasan
 
[ ARRIVAL-TR-0193.pdf, details ]
Incentive-Compatible Robust Line Planning
Apostolos Bessas, Spyros Kontogiannis, and Christos Zaroliagis
 
[ ARRIVAL-TR-0194.pdf, details ]
The New Dutch Timetable: The OR Revolution
L.G. Kroon, D. Huisman, E.J.W. Abbink, P.J. Fioole, M. Fischetti, G. Maroti, A. Schrijver, A. Steenbeek and R. Ybema
Interfaces 39(1), pp. 6–17, 2009
[ ARRIVAL-TR-0195.pdf, details ]
Bidirectional A* Search for Time-Dependent Fast Paths
Giacomo Nannicini and Daniel Delling and Leo Liberti and Dominik Schultes
published at WEA'08
[ ARRIVAL-TR-0196.pdf, details ]
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
Daniel Delling and Giacomo Nannicini
published at ISAAC'08
[ ARRIVAL-TR-0197.pdf, details ]
Combining Hierarchical and Goal-Directed Speed-Up Techniques for Dijkstra's Algorithm
Reinhard Bauer and Daniel Delling and Peter Sanders and Dennis Schieferdecker and Dominik Schultes and Dorothea Wagner
published at WEA'08
[ ARRIVAL-TR-0198.pdf, details ]
Contraction Hierarchies: Faster and Simpler Hierarchical Routing in Road Networks
Robert Geisberger and Peter Sanders and Dominik Schultes and Daniel Delling
published at WEA'08
[ ARRIVAL-TR-0199.pdf, details ]
Engineering Time-Expanded Graphs for Faster Timetable Information
Daniel Delling and Thomas Pajor and Dorothea Wagner
published at ATMOS'08
[ ARRIVAL-TR-0200.pdf, details ]
The Shortcut Problem — Complexity and Approximation
Reinhard Bauer and Gianlorenzo D'Angelo and Daniel Delling and Dorothea Wagner
published at SOFSEM'09
[ ARRIVAL-TR-0201.pdf, details ]
Time-Dependent Contraction Hierarchies
Veit Batz and Daniel Delling and Peter Sanders and Christian Vetter
published at ALENEX'09
[ ARRIVAL-TR-0202.pdf, details ]
Time-Dependent SHARC-Routing
Daniel Delling
published at ESA'08
[ ARRIVAL-TR-0203.pdf, details ]
Mining Railway Delay Dependencies in Large-Scale Real-World Delay Data
Holger Flier, Rati Gelashvili, Thomas Graffagnino, Marc Nunkesser
submitted to: Special Volume on Robust an Online Large-Scale Optimization
[ ARRIVAL-TR-0204.pdf, details ]
A Rolling Horizon Based Framework for Rolling Stock Rescheduling
Lars Kjær Nielsen, Leo Kroon, and Gabor Maroti
 
[ ARRIVAL-TR-0205.pdf, details ]
LinTim — A Toolbox for the Experimental Evaluation of the Interaction of Different Planning Stages in Public Transportation
Michael Schachtebeck and Anita Schöbel
 
[ ARRIVAL-TR-0206.pdf, details ]
The Speed of Convergence in Congestion Games under Best-Response Dynamics
Angelo Fanelli, Michele Flammini, and Luca Moscardelli
Published at ICALP
[ ARRIVAL-TR-0207.pdf, details ]
Column generation with dynamic duty selection for railway crew rescheduling
Daniel Potthoff, Dennis Huisman, Guy Desaulniers
submitted to Transportation Science
[ ARRIVAL-TR-0208.pdf, details ]
A Task Based Model for Rolling Stock Scheduling
Lars Kjær Nielsen
 
[ ARRIVAL-TR-0209.pdf, details ]
Robustness in Railway Transportation Scheduling
Miguel Angel Salido, Federico Barber, Laura Ingolotti
Proc. of the Intelligent Control and Automation, 2008. WCICA 2008. ISBN 978–1−4244–2113–8
[ ARRIVAL-TR-0210.pdf, details ]
Analytical Methods for Homogeneous Trains in Double-Line Railway Scheduling
Miguel Angel Salido, Federico Barber, Laura Ingolotti
In proc. of Workshop on Planning, Scheduling and Constraint Satisfaction, Iberamia 2008. pp 43—52
[ ARRIVAL-TR-0211.pdf, details ]
A Simulation Tool to evaluate the Robustness of Railway Timetables
Federico Barber, Miguel Angel Salido, Laura Ingolotti
In proc. of Workshop on Planning, Scheduling and Constraint Satisfaction, Iberamia 2008, pp 77—86
[ ARRIVAL-TR-0212.pdf, details ]
Robustness and capacity in scheduling: Application to railway timetabling
Laura Climent, Federico Barber, Miguel Angel Salido, Laura Ingolotti
In proc. of Workshop on Planning, Scheduling and Constraint, Iberamia 2008, pp 87—96
[ ARRIVAL-TR-0213.pdf, details ]
Mathematical Solutions for Solving Periodic Railway Transportation
Miguel Angel Salido, Federico Barber
Mathematical Problems in Engineering, Hindawi Publishing Corporation (Index in JCR’2008: 0.376), to appear.
[ ARRIVAL-TR-0214.pdf, details ]
Analytical Robustness in Single-Line Railway Timetabling
Miguel Angel Salido, Federico Barber, Laura Ingolotti
International Transaction of Systems Science and Applications, ISSN 1751–1461, to appear
[ ARRIVAL-TR-0215.pdf, details ]
Robust Train Routing
Alberto Caprara, Laura Galli, Leo Kroon, Gabor Maroti, Paolo Toth
Sumbitted to CASPT09.
[ ARRIVAL-TR-0216.pdf, details ]
A Dynamic Programming Approach for Recoverable Robust Timetables on Trees
Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Cristina M. Pinotti
COCOA2009 LNCS vol. 5573
[ ARRIVAL-TR-0217.pdf, details ]
Integrating Robust Network Design and Line Planning under Failures
Ángel Marín, Juan A. Mesa and Federico Perea
Submitted to the special ARRIVAL number in Lecture Notes in Computer Science
[ ARRIVAL-TR-0218.pdf, details ]
Extending Concepts of Reliability. Network Creation Games, Real-time Scheduling, and Robust Optimization
Sebastian Stiller
Phd Thesis
[ ARRIVAL-TR-0219.pdf, details ]
How the topology of a transportation system affects its robustness
De-Los-Santos, A., Mesa, J.A. and Perea, F.
 
[ ARRIVAL-TR-0220.pdf, details ]
Robust sequencing on a single machine
A. Marchetti-Spaccamela, N. Megow, M. Skutella, L. Stougie
 
[ ARRIVAL-TR-0221.pdf, details ]
Optimal Allocation of Fleet Frequency for Strategies of Stop Reduction in Railway Systems
J.A. Mesa, F.A. Ortega and M.A. Pozo
 
[ ARRIVAL-TR-0222.pdf, details ]
Locating a Metro Line in a Historical City Centre: Application to Sevilla
Gilbert Laporte, Juan A. Mesa, Francisco Ortega and Miguel Pozo
to appear in the Journal of the Operational Research Society
[ ARRIVAL-TR-0223.pdf, details ]
Evaluating the Passenger Robustness of a Urban Railway Network
Alicia De-Los-Santos, Juan A. Mesa and Federico Perea
a preliminary version was presented at RailZurich2009
[ ARRIVAL-TR-0224.pdf, details ]
Non-cyclic Train Timetabling and Comparability Graphs
V. Cacchiani, A. Caprara and P.Toth
 
[ ARRIVAL-TR-0225.pdf, details ]
Multi-Stage Recovery Robustness for Optimization Problems: a new Concept for Planning under Disturbances
S. Cicerone and G. di Stefano and M. Schachtebeck and A. Schoebel
 
[ ARRIVAL-TR-0226.pdf, details ]
The on-line prize-collecting traveling salesman problem
G. Ausiello, V. Bonifaci, L. Laura
Information Processing Letters, 107(6):199—204, 2008
[ ARRIVAL-TR-0227.pdf, details ]
On the power of lookahead in on-line server routing problems
L. Allulli, G. Ausiello, V. Bonifaci, L. Laura
Theoretical Computer Science, 408(2—3):116—128, 2008
[ ARRIVAL-TR-0228.pdf, details ]
MIP Computation and beyond
A. Lodi
 
[ ARRIVAL-TR-0229.pdf, details ]
Robustness in Train Timetabling
V. Cacchiani, A. Caprara and M. Fischetti
 
[ ARRIVAL-TR-0230.pdf, details ]
D^2-Tree: A Determenistic Distributed-Tree Structure for Peer-to-Peer Networks
G.S. Brodal, S. Sioutas and K. tsichlas
 
[ ARRIVAL-TR-0231.pdf, details ]
An Experimental Study of QoS-aware Multicommodity Flow
Apostolos Bessas and Christos Zaroliagis
 
[ ARRIVAL-TR-0232.pdf, details ]
Robust Line Planning under Unknown Incentives and Elasticity of Frequencies
Spyros Kontogiannis and Christos Zaroliagis
Proc. 8th Workshop on Algorithmic Approaches for Transportation Modeling, Optimization, and Systems — ATMOS 2008
[ ARRIVAL-TR-0233.pdf, details ]
Engineering and Augmenting Route Planning Algorithms
Daniel Delling
PhD Thesis
[ ARRIVAL-TR-0234.pdf, details ]
Models and methods for efficiency and optimality in railway timetabling
Laura Ingolotti
PhD Thesis
[ ARRIVAL-TR-0235.pdf, details ]
Partitioning and multivariable distributed resolution of Constraint Satisfaction Problems
Montserrat Abril
PhD Thesis
[ ARRIVAL-TR-0236.pdf, details ]
Evaluation of advanced solution techniques for railway Mixed-Integer Programs
Matteo Fischetti, Andrea Lodi, Domenico Salvagnin and Arrigo Zanette
 
[ ARRIVAL-TR-0237.pdf, details ]
Evaluating Network Robustness: Application to Metro Systems
Elisa Calvo, Juan Antonio Mesa
MSc Thesis
[ ARRIVAL-TR-0238.pdf, details ]
An Approach to Rapid Transit Rolling Stock Assignment
Ángel Marín, Luis Cadarso
Conference Rail Zurich2009
[ ARRIVAL-TR-0239.pdf, details ]
The Rapid Transit Routing Problem
Ángel Marín, Luis Cadarso
11th International Conference on Advanced Systems for Public Transport (CASPT 2009) (20–22 June 2009) Hong-Kong
[ ARRIVAL-TR-0240.pdf, details ]
Constraint Programming Techniques for Mixed Integer Linear Programs
Domenico Salvagnin
 
[ ARRIVAL-TR-0241.pdf, details ]
Three topics in mixed integer programming
Arrigo Zanette
 
[ ARRIVAL-TR-0242.pdf, details ]
Total: 242 TRs in this category.

Showing documents for all workpackages. View: WP1, WP2, WP3, WP4, WP5, WP6