Paolo Dell'Olmo

Orcid: 0000-0001-9607-778X

According to our database1, Paolo Dell'Olmo authored at least 65 papers between 1989 and 2019.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



Minimum Cost Design of Cellular Networks in Rural Areas With UAVs, Optical Rings, Solar Panels, and Batteries.
IEEE Trans. Green Commun. Netw., 2019

Sparse analytic hierarchy process: an experimental analysis.
Soft Comput., 2019

Optimal management of reusable functional blocks in 5G superfluid networks.
Int. J. Netw. Manag., 2019

Mathematical Models for On-Line Train Calendars Generation.
Comput. Oper. Res., 2019

Optimal Throughput Management in UAV-based Networks during Disasters.
Proceedings of the IEEE INFOCOM 2019, 2019

Optimal Design of 5G Networks in Rural Zones with UAVs, Optical Rings, Solar Panels and Batteries.
Proceedings of the 2018 20th International Conference on Transparent Optical Networks (ICTON), 2018

Lifetime-Aware ISP Networks: Optimal Formulation and Solutions.
IEEE/ACM Trans. Netw., 2017

Optimal superfluid management of 5G networks.
Proceedings of the 2017 IEEE Conference on Network Softwarization, 2017

LIFETEL: Managing the Energy-Lifetime Trade-off in Telecommunication Networks.
IEEE Commun. Mag., 2016

Optimal sustainable management of backbone networks.
Proceedings of the 18th International Conference on Transparent Optical Networks, 2016

A new approach for train calendar description generation.
Proceedings of the 2015 International Conference on Models and Technologies for Intelligent Transportation Systems (MT-ITS), 2015

Sleep to stay alive: Optimizing reliability in energy-efficient backbone networks.
Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

An aggregate stochastic programming model for air traffic flow management.
Eur. J. Oper. Res., 2011

The Spatially Equitable Multicommodity Capacitated Network Flow Problem.
Proceedings of the Network Optimization - 5th International Conference, 2011

The maximum labeled clique problem.
Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

Novel Local-Search-Based Approaches to University Examination Timetabling.
INFORMS J. Comput., 2008

Embedding a novel objective function in a two-phased local search for robust vertex coloring.
Eur. J. Oper. Res., 2008

Coloring graphs by iterated local search traversing feasible and infeasible solutions.
Discret. Appl. Math., 2008

Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates.
Comput. Oper. Res., 2008

Coupling Stochastic and Deterministic Local Search in Examination Timetabling.
Oper. Res., 2007

Comput. Oper. Res., 2007

Delivery itineraries and distribution capacity of a freight network with time slots.
Comput. Oper. Res., 2007

Scheduling models for air traffic control in terminal areas.
J. Sched., 2006

Graph models for scheduling systems with machine saturation property.
Math. Methods Oper. Res., 2006

CHECKCOL: Improved local search for graph coloring.
J. Discrete Algorithms, 2006

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem.
Electron. Notes Discret. Math., 2006

Lower bound algorithms for multiprocessor task scheduling with ready times.
Int. Trans. Oper. Res., 2005

On finding dissimilar Pareto-optimal paths.
Eur. J. Oper. Res., 2005

On uniform <i>k</i>-partition problems.
Discret. Appl. Math., 2005

Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem.
Comput. Oper. Res., 2005

Bounding vertex coloring by truncated <i>multistage</i> branch and bound.
Networks, 2004

Planning Activities in a Network of Logistic Platforms with Shared Resources.
Ann. Oper. Res., 2004

Assessing the resource usage in scheduling with incompatibilities.
OR Spectr., 2003

A new hierarchical architecture for Air Traffic Management: Optimisation of airway capacity in a Free Flight scenario.
Eur. J. Oper. Res., 2003

Scheduling multiprocessor tasks on parallel processors with limited availability.
Eur. J. Oper. Res., 2003

Complexity and approximation results for scheduling multiprocessor tasks on a ring.
Discret. Appl. Math., 2003

Scheduling multiprocessor tasks on two parallel processors.
RAIRO Oper. Res., 2002

Constraint Propagation in Graph Coloring.
J. Heuristics, 2002

An approximation result for the interval coloring problem on claw-free chordal graphs.
Discret. Appl. Math., 2002

Solving the minimum-weighted coloring problem.
Networks, 2001

A lower bound on the chromatic number of Mycielski graphs.
Discret. Math., 2001

An approximation result for a periodic allocation problem.
Discret. Appl. Math., 2001

Scheduling multiprocessor tasks for mean flow time criterion.
Comput. Oper. Res., 2000

New Algorithms for Examination Timetabling.
Proceedings of the Algorithm Engineering, 2000

Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.
Discret. Appl. Math., 1999

Minimizing total completion time subject to release dates and sequence-dependentprocessing times.
Ann. Oper. Res., 1999

Vertex Partitioning of Crown-Free Interval Graphs.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

A Fast and Simple Local Search for Graph Coloring.
Proceedings of the Algorithm Engineering, 1999

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.
Inf. Process. Lett., 1998

Heuristics for multimode scheduling problems with dedicated resources.
Eur. J. Oper. Res., 1998

Scheduling Chains to Minimize Mean Flow Time.
Inf. Process. Lett., 1997

An Approximation Result for a Duo-Processor Task Scheduling Problem.
Inf. Process. Lett., 1997

Efficiency and effectiveness of normal schedules on three dedicated processors.
Discret. Math., 1997

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.
Discret. Appl. Math., 1997

Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness.
Discret. Appl. Math., 1997

An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets.
Comput. Optim. Appl., 1997

Preemptive multiprocessor task scheduling with release times and time windows.
Ann. Oper. Res., 1997

Scheduling Independent Tasks with Multiple Modes.
Discret. Appl. Math., 1995

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors.
Ann. Oper. Res., 1995

Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors.
Perform. Evaluation, 1994

Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors.
Inf. Process. Lett., 1994

Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness.
Inf. Process. Lett., 1993

The minimization of resource costs in scheduling independent tasks with fixed completion time.
Proceedings of the System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, 1993

Scheduling Multiprocessor Tasks on Three Dedicated Processors.
Inf. Process. Lett., 1992

A Mixed-Mode Man-Machine Interface for Interactive Problem Solving.
Proceedings of the Workstations for Experiments, 1989