Technical Report Library - Work Package 1

Sort by: Work Packages, Year, Title
Filter: All years, 2006, 2007, 2008, 2009
Return to main page

100 TRs in this category.
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
When Periodic Timetables are Suboptimal
Ralf Borndörfer and Christian Liebchen
To appear in OR Proceedings 2007
[ ARRIVAL-TR-0114.pdf, details ]
Light Robustness
Matteo Fischetti and Michele Monaci
 
[ ARRIVAL-TR-0119.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 ]
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 ]
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 ]
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 ]
Algorithmic Methods for Railway Optimization
Frank Geraets, Leo Kroon, Anita Schoebel, Dorothea Wagner, Christos Zaroliagis (editors)
LNCS volume 4359
[ ARRIVAL-TR-0145.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 ]
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 ]
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 ]
Recoverable-Robust Platforming by Network Buffering
Alberto Caprara, Laura Galli, Sebastian Stiller, Paolo Toth
 
[ ARRIVAL-TR-0157.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 ]
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 ]
Feasibility Pump 2.0
Matteo Fischetti and Domenico Salvagnin
 
[ ARRIVAL-TR-0165.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 ]
Evaluation of Computational Methods for Freight Train Classification Schedules
Jens Maue, Marc Nunkesser
 
[ ARRIVAL-TR-0184.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 ]
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 ]
Time-Dependent SHARC-Routing
Daniel Delling
published at ESA'08
[ ARRIVAL-TR-0203.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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
Total: 100 TRs in this category.

Showing documents for work package 1. View: All, WP2, WP3, WP4, WP5, WP6