Enrico Angelelli

According to our database, Enrico Angelelli authored at least 34 papers between 2002 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of two.

2023

Solving the probabilistic profitable tour problem on a line.

Enrico Angelelli, Renata Mansini, Romeo Rizzi

Optim. Lett., November, 2023

2022

Solving the Probabilistic Profitable Tour Problem on a Tree.

Enrico Angelelli, Renata Mansini, Romeo Rizzi

CoRR, 2022

A simulation framework for a station-based bike-sharing system.

Enrico Angelelli, M. Chiari, Andrea Mor, Maria Grazia Speranza

Comput. Ind. Eng., 2022

2021

System optimal routing of traffic flows with user constraints using linear programming.

Enrico Angelelli, Valentina Morandi, Martin W. P. Savelsbergh, Maria Grazia Speranza

Eur. J. Oper. Res., 2021

A dynamic and probabilistic orienteering problem.

Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni

Comput. Oper. Res., 2021

2020

Minimizing the total travel time with limited unfairness in traffic networks.

Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza

Comput. Oper. Res., 2020

A matheuristic for the air transportation freight forwarder service problem.

Enrico Angelelli, Claudia Archetti, Lorenzo Peirano

Comput. Oper. Res., 2020

2019

A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints.

Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza

Comput. Oper. Res., 2019

Timing portfolio strategies with exponential Lévy processes.

Sergio Ortobelli Lozza, Enrico Angelelli, Alda Ndoci

Comput. Manag. Sci., 2019

2018

Congestion avoiding heuristic path generation for the proactive route guidance.

Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza

Comput. Oper. Res., 2018

2017

The Traveling Purchaser Problem with time-dependent quantities.

Enrico Angelelli, Michel Gendreau, Renata Mansini, Michele Vindigni

Comput. Oper. Res., 2017

The probabilistic orienteering problem.

Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni

Comput. Oper. Res., 2017

2016

The Stochastic and Dynamic Traveling Purchaser Problem.

Enrico Angelelli, Renata Mansini, Michele Vindigni

Transp. Sci., 2016

A reclaimer scheduling problem arising in coal stockyard management.

Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh

J. Sched., 2016

2014

Complexity and approximation for Traveling Salesman Problems with profits.

Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza

Theor. Comput. Sci., 2014

The Clustered Orienteering Problem.

Enrico Angelelli, Claudia Archetti, Michele Vindigni

Eur. J. Oper. Res., 2014

Reclaimer Scheduling: Complexity and Algorithms.

Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh

CoRR, 2014

Optimal interval scheduling with a resource constraint.

Enrico Angelelli, Nicola Bianchessi, Carlo Filippi

Comput. Oper. Res., 2014

2012

Kernel Search: a new heuristic framework for portfolio selection.

Enrico Angelelli, Renata Mansini, Maria Grazia Speranza

Comput. Optim. Appl., 2012

2011

On the complexity of interval scheduling with a resource constraint.

Enrico Angelelli, Carlo Filippi

Theor. Comput. Sci., 2011

Look-ahead heuristics for the dynamic traveling purchaser problem.

Enrico Angelelli, Renata Mansini, Michele Vindigni

Comput. Oper. Res., 2011

2010

Geometric representation for semi on-line scheduling on uniform processors.

Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza

Optim. Methods Softw., 2010

Comparison of policies in dynamic routing problems.

Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza

J. Oper. Res. Soc., 2010

Kernel search: A general heuristic for the multi-dimensional knapsack problem.

Enrico Angelelli, Renata Mansini, Maria Grazia Speranza

Comput. Oper. Res., 2010

2009

Exploring greedy criteria for the dynamic traveling purchaser problem.

Enrico Angelelli, Renata Mansini, Michele Vindigni

Central Eur. J. Oper. Res., 2009

Maximum Expected Utility of Markovian Predicted Wealth.

Enrico Angelelli, Sergio Ortobelli Lozza

Proceedings of the Computational Science, 2009

2008

Semi-online scheduling on two uniform processors.

Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza

Theor. Comput. Sci., 2008

2007

Competitive analysis of a dispatch policy for a dynamic multi-period routing problem.

Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza

Oper. Res. Lett., 2007

Competitive analysis for dynamic multiperiod uncapacitated routing problems.

Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh

Networks, 2007

2006

New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks.

Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza

Discret. Math. Theor. Comput. Sci., 2006

2004

The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks.

Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza

J. Sched., 2004

2003

Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.

Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza

Algorithmica, 2003

2002

The application of a vehicle routing model to a waste-collection problem: two case studies.

Enrico Angelelli, M. Grazia Speranza

J. Oper. Res. Soc., 2002

The periodic vehicle routing problem with intermediate facilities.

Enrico Angelelli, Maria Grazia Speranza

Eur. J. Oper. Res., 2002