Paolo Dell'Olmo

IEEE Trans. Green Commun. Netw., 2019

Sparse analytic hierarchy process: an experimental analysis.

[BibT_eX]

[DOI]

Soft Comput., 2019

Optimal management of reusable functional blocks in 5G superfluid networks.

[BibT_eX]

[DOI]

Mohammad Shojafar

Stefano Salsano

Int. J. Netw. Manag., 2019

Mathematical Models for On-Line Train Calendars Generation.

[BibT_eX]

[DOI]

Giovanni Luca Giacco

Comput. Oper. Res., 2019

Optimal Throughput Management in UAV-based Networks during Disasters.

[BibT_eX]

[DOI]

Carla-Fabiana Chiasserini

Francesco Malandrino

Claudio Casetti

Proceedings of the IEEE INFOCOM 2019, 2019

2018

Optimal Design of 5G Networks in Rural Zones with UAVs, Optical Rings, Solar Panels and Batteries.

[BibT_eX]

[DOI]

Carlos Natalino

Paolo Monti

Proceedings of the 2018 20th International Conference on Transparent Optical Networks (ICTON), 2018

2017

Lifetime-Aware ISP Networks: Optimal Formulation and Solutions.

[BibT_eX]

[DOI]

IEEE/ACM Trans. Netw., 2017

Optimal superfluid management of 5G networks.

[BibT_eX]

[DOI]

Stefania Cartolano

Mohammad Shojafar

Stefano Salsano

Proceedings of the 2017 IEEE Conference on Network Softwarization, 2017

2016

LIFETEL: Managing the Energy-Lifetime Trade-off in Telecommunication Networks.

[BibT_eX]

[DOI]

IEEE Commun. Mag., 2016

Optimal sustainable management of backbone networks.

[BibT_eX]

[DOI]

Proceedings of the 18th International Conference on Transparent Optical Networks, 2016

2015

A new approach for train calendar description generation.

[BibT_eX]

[DOI]

Giovanni Luca Giacco

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.

[BibT_eX]

[DOI]

Proceedings of the 17th International Conference on Transparent Optical Networks, 2015

2011

An aggregate stochastic programming model for air traffic flow management.

[BibT_eX]

[DOI]

Giovanni Andreatta

Guglielmo Lulli

Eur. J. Oper. Res., 2011

The Spatially Equitable Multicommodity Capacitated Network Flow Problem.

[BibT_eX]

[DOI]

Antonino Sgalambro

Proceedings of the Network Optimization - 5th International Conference, 2011

The maximum labeled clique problem.

[BibT_eX]

[DOI]

Raffaele Cerulli

Francesco Carrabs

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2008

Novel Local-Search-Based Approaches to University Examination Timetabling.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

INFORMS J. Comput., 2008

Embedding a novel objective function in a two-phased local search for robust vertex coloring.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Coloring graphs by iterated local search traversing feasible and infeasible solutions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2008

Exploiting incomplete information to manage multiprocessor tasks with variable arrival rates.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2008

2007

Coupling Stochastic and Deterministic Local Search in Examination Timetabling.

[BibT_eX]

[DOI]

Oper. Res., 2007

Editorial.

[BibT_eX]

[DOI]

Raffaele Pesenti

Comput. Oper. Res., 2007

Delivery itineraries and distribution capacity of a freight network with time slots.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2007

2006

Scheduling models for air traffic control in terminal areas.

[BibT_eX]

[DOI]

J. Sched., 2006

Graph models for scheduling systems with machine saturation property.

[BibT_eX]

[DOI]

Monica Gentili

Math. Methods Oper. Res., 2006

CHECKCOL: Improved local search for graph coloring.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

J. Discrete Algorithms, 2006

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2005

Lower bound algorithms for multiprocessor task scheduling with ready times.

[BibT_eX]

[DOI]

Antonio Iovanella

Int. Trans. Oper. Res., 2005

On finding dissimilar Pareto-optimal paths.

[BibT_eX]

[DOI]

Monica Gentili

Andrea Scozzari

Eur. J. Oper. Res., 2005

On uniform <i>k</i>-partition problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2005

Experimental evaluation of approximation and heuristic algorithms for the dominating paths problem.

[BibT_eX]

[DOI]

Monica Gentili

Comput. Oper. Res., 2005

2004

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

[BibT_eX]

[DOI]

Networks, 2004

Planning Activities in a Network of Logistic Platforms with Shared Resources.

[BibT_eX]

[DOI]

Guglielmo Lulli

Ann. Oper. Res., 2004

2003

Assessing the resource usage in scheduling with incompatibilities.

[BibT_eX]

[DOI]

OR Spectr., 2003

A new hierarchical architecture for Air Traffic Management: Optimisation of airway capacity in a Free Flight scenario.

[BibT_eX]

[DOI]

Guglielmo Lulli

Eur. J. Oper. Res., 2003

Scheduling multiprocessor tasks on parallel processors with limited availability.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2003

Complexity and approximation results for scheduling multiprocessor tasks on a ring.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

2002

Scheduling multiprocessor tasks on two parallel processors.

[BibT_eX]

[DOI]

Jacek Blazewicz

RAIRO Oper. Res., 2002

Constraint Propagation in Graph Coloring.

[BibT_eX]

[DOI]

J. Heuristics, 2002

An approximation result for the interval coloring problem on claw-free chordal graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

2001

Solving the minimum-weighted coloring problem.

[BibT_eX]

[DOI]

Networks, 2001

A lower bound on the chromatic number of Mycielski graphs.

[BibT_eX]

[DOI]

Discret. Math., 2001

An approximation result for a periodic allocation problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2001

2000

Scheduling multiprocessor tasks for mean flow time criterion.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2000

New Algorithms for Examination Timetabling.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

Proceedings of the Algorithm Engineering, 2000

1999

Approximation Algorithms for Partitioning Small Items in Unequal Bins to Minimize the Total Size.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Minimizing total completion time subject to release dates and sequence-dependentprocessing times.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1999

Vertex Partitioning of Crown-Free Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

A Fast and Simple Local Search for Graph Coloring.

[BibT_eX]

[DOI]

Proceedings of the Algorithm Engineering, 1999

1998

A 13/12 Approximation Algorithm for Bin Packing with Extendable Bins.

[BibT_eX]

[DOI]

Hans Kellerer

Zsolt Tuza

Inf. Process. Lett., 1998

Heuristics for multimode scheduling problems with dedicated resources.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 1998

1997

Scheduling Chains to Minimize Mean Flow Time.

[BibT_eX]

[DOI]

Moshe Dror

Wieslaw Kubiak

Inf. Process. Lett., 1997

An Approximation Result for a Duo-Processor Task Scheduling Problem.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Efficiency and effectiveness of normal schedules on three dedicated processors.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Math., 1997

Comparability Graph Augmentation for some Multiprocessor Scheduling Problems.

[BibT_eX]

[DOI]

Zsolt Tuza

Discret. Appl. Math., 1997

Linear Algorithms for Preemptive Scheduling of Multiprocessor Tasks Subject to Minimal Lateness.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

An Optimal Algorithm to Find the Jump Number of Partially Ordered Sets.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 1997

Preemptive multiprocessor task scheduling with release times and time windows.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1997

1995

Scheduling Independent Tasks with Multiple Modes.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

Scheduling multiprocessor tasks on a dynamic configuration of dedicated processors.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1995

1994

Scheduling Preemptive Multiprocessor Tasks on Dedicated Processors.

[BibT_eX]

[DOI]

Perform. Evaluation, 1994

Corrigendum: Scheduling Multiprocessor Tasks on Three Dedicated Processors.

[BibT_eX]

Jacek Blazewicz

Inf. Process. Lett., 1994

1993

Preemptive Scheduling of Multiprocessor Tasks on the Dedicated Processor System Subject to Minimal Lateness.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1993

The minimization of resource costs in scheduling independent tasks with fixed completion time.

[BibT_eX]

[DOI]

Proceedings of the System Modelling and Optimization: Proceedings of the 16th IFIP-TC7 Conference, 1993

1992

Scheduling Multiprocessor Tasks on Three Dedicated Processors.

[BibT_eX]

[DOI]

Jacek Blazewicz