Technical Report Library - Work Package 3

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

105 TRs in this category.
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
Stochastic Improvement of Cyclic Railway Timetables
Leo Kroon, Rommert Dekker, Gabor Maroti, Mathijn Retel Helmrich, and Michiel Vromans
 
[ ARRIVAL-TR-0031.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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
Computing Delay Resistant Railway Timetables
Christian Liebchen, Michael Schachtebeck, Anita Schöbel, Sebastian Stiller, Andre Prigge
 
[ ARRIVAL-TR-0071.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 ]
SHARC: Fast and Robust Unidirectional Routing
Reinhard Bauer and Daniel Delling
to appear in the Proceedings of ALENEX'08
[ ARRIVAL-TR-0078.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 ]
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 ]
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 ]
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 ]
Integrating Line Planning, Timetabling, and Vehicle Scheduling: A customer-oriented approach
Mathias Michaelis and Anita Schöbel
 
[ ARRIVAL-TR-0096.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 ]
The Complexity of the Shortcut Problem
Reinhard Bauer, Gianlorenzo D'Angelo, Daniel Delling, Dorothea Wagner
 
[ ARRIVAL-TR-0117.pdf, details ]
Light Robustness
Matteo Fischetti and Michele Monaci
 
[ ARRIVAL-TR-0119.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 ]
Timetable Information Updating in Case of Delays: Modeling Issues
Daniel Delling, Kalliopi Giannakopoulou, Dorothea Wagner, and Christos Zaroliagis
 
[ ARRIVAL-TR-0133.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 ]
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 ]
Linien-, Fahrplan-, Umlauf- und Dienstplanoptimierung: Wie weit können diese bereits integriert werden?
Christian Liebchen
HEUREKA 2008 Tagungsbericht
[ ARRIVAL-TR-0154.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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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 ]
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: 105 TRs in this category.

Showing documents for work package 3. View: All, WP1, WP2, WP4, WP5, WP6