Enrico Angelelli

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 16

Top Topics

Scheduling Problem

Traveling Salesman

Top Venues

Comput. Oper. Res.

Eur. J. Oper. Res.

Discret. Appl. Math.

Publications

Enrico Angelelli, Andrea Mor, Maria Grazia Speranza
The one-station bike repositioning problem. Discret. Appl. Math. 357 (2024)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
Multi-day fair collaboration in demand-responsive transportation. Central Eur. J. Oper. Res. 32 (2) (2024)
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17 (8) (2023)
Enrico Angelelli, M. Chiari, Andrea Mor, Maria Grazia Speranza
A simulation framework for a station-based bike-sharing system. Comput. Ind. Eng. 171 (2022)
Enrico Angelelli, Renata Mansini, Romeo Rizzi
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR (2022)
Enrico Angelelli, Valentina Morandi, Martin W. P. Savelsbergh, Maria Grazia Speranza
System optimal routing of traffic flows with user constraints using linear programming. Eur. J. Oper. Res. 293 (3) (2021)
Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni
A dynamic and probabilistic orienteering problem. Comput. Oper. Res. 136 (2021)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
Minimizing the total travel time with limited unfairness in traffic networks. Comput. Oper. Res. 123 (2020)
Enrico Angelelli, Claudia Archetti, Lorenzo Peirano
A matheuristic for the air transportation freight forwarder service problem. Comput. Oper. Res. 123 (2020)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints. Comput. Oper. Res. 110 (2019)
Sergio Ortobelli Lozza, Enrico Angelelli, Alda Ndoci
Timing portfolio strategies with exponential Lévy processes. Comput. Manag. Sci. 16 (1-2) (2019)
Enrico Angelelli, Valentina Morandi, Maria Grazia Speranza
Congestion avoiding heuristic path generation for the proactive route guidance. Comput. Oper. Res. 99 (2018)
Enrico Angelelli, Claudia Archetti, Carlo Filippi, Michele Vindigni
The probabilistic orienteering problem. Comput. Oper. Res. 81 (2017)
Enrico Angelelli, Michel Gendreau, Renata Mansini, Michele Vindigni
The Traveling Purchaser Problem with time-dependent quantities. Comput. Oper. Res. 82 (2017)
Enrico Angelelli, Renata Mansini, Michele Vindigni
The Stochastic and Dynamic Traveling Purchaser Problem. Transp. Sci. 50 (2) (2016)
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19 (5) (2016)
Enrico Angelelli, Nicola Bianchessi, Carlo Filippi
Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51 (2014)
Enrico Angelelli, Cristina Bazgan, Maria Grazia Speranza, Zsolt Tuza
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531 (2014)
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
Reclaimer Scheduling: Complexity and Algorithms. CoRR (2014)
Enrico Angelelli, Claudia Archetti, Michele Vindigni
The Clustered Orienteering Problem. Eur. J. Oper. Res. 238 (2) (2014)
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51 (1) (2012)
Enrico Angelelli, Carlo Filippi
On the complexity of interval scheduling with a resource constraint. Theor. Comput. Sci. 412 (29) (2011)
Enrico Angelelli, Renata Mansini, Michele Vindigni
Look-ahead heuristics for the dynamic traveling purchaser problem. Comput. Oper. Res. 38 (12) (2011)
Enrico Angelelli, Renata Mansini, Maria Grazia Speranza
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37 (11) (2010)
Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61 (4) (2010)
Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza
Geometric representation for semi on-line scheduling on uniform processors. Optim. Methods Softw. 25 (3) (2010)
Enrico Angelelli, Sergio Ortobelli Lozza
Maximum Expected Utility of Markovian Predicted Wealth. ICCS (2) (2009)
Enrico Angelelli, Renata Mansini, Michele Vindigni
Exploring greedy criteria for the dynamic traveling purchaser problem. Central Eur. J. Oper. Res. 17 (2) (2009)
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393 (1-3) (2008)
Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Oper. Res. Lett. 35 (6) (2007)
Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh
Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49 (4) (2007)
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Discret. Math. Theor. Comput. Sci. 8 (1) (2006)
Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Sched. 7 (6) (2004)
Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. Algorithmica 37 (4) (2003)
Enrico Angelelli, M. Grazia Speranza
The application of a vehicle routing model to a waste-collection problem: two case studies. J. Oper. Res. Soc. 53 (9) (2002)
Enrico Angelelli, Maria Grazia Speranza
The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137 (2) (2002)