Publication
Combinatorial Learning in Traffic Management
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1726304
Giorgio Sartor
Research Scientist
Giorgio Sartor
Research Scientist
Phone:
+47 950 10 649
Email:
giorgio.sartor@sintef.no
Unit:
SINTEF Digital
Department:
Mathematics and Cybernetics
Office:
Oslo
Publications and responsibilities
Publication
Inventory Management under Storage and Order Restrictions
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1726341
Inventory management in most practical settings faces challenges due to various restrictions on storage and replenishment of products. These restrictions may be posed by budget availability, different production/supply schedules for different products, and limited storage space shared by a number of...
Publication
Combinatorial Learning in Traffic Management
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1726252
Publication
The landscape of quantum algorithms
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1705693
Year
2019
Type
Conference lecture and academic presentation
Publication
An Exact Algorithm for Robust Influence Maximization
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1705499
Publication
MILP approaches to practical real-time train scheduling: the Iron Ore Line case
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1694117
Publication
Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1654423
We extend the new, efficient Path&Cycle formulation for the Hotspot Problem with two methods for dealing with windowed capacity constraints. We also discuss how to combine constraints to allow two-level capacity restricions for peak and average load respectively. Finally, we present computationa...
Publication
Hotspot Resolution with Sliding Window Capacity Constraints using the Path&Cycle Algorithm
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1648719
We extend the new, efficient Path&Cycle formulation for the Hotspot Problem with two methods for dealing with windowed capacity constraints. We also discuss how to combine constraints to allow two-level capacity restricions for peak and average load respectively. Finally, we present computationa...
Year
2018
Type
Conference lecture and academic presentation
Publication
The Path&Cycle Formulation for the Hotspot Problem in Air Traffic Management
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1629483
Publication
Modelling and Solving the Hotspot Problem in Air Traffic Control.
https://www.sintef.no/en/publications/publication/?pubid=CRIStin+1614480