default search action
Enrico Angelelli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j34]Enrico Angelelli, Valentina Morandi
, Maria Grazia Speranza:
Multi-day fair collaboration in demand-responsive transportation. Central Eur. J. Oper. Res. 32(2): 209-239 (2024) - [j33]Enrico Angelelli, Andrea Mor
The one-station bike repositioning problem. Discret. Appl. Math. 357: 173-196 (2024) - 2023
- [j32]Enrico Angelelli
Solving the probabilistic profitable tour problem on a line. Optim. Lett. 17(8): 1873-1888 (2023) - 2022
- [j31]Enrico Angelelli
A simulation framework for a station-based bike-sharing system. Comput. Ind. Eng. 171: 108489 (2022) - [i2]Enrico Angelelli, Renata Mansini, Romeo Rizzi:
Solving the Probabilistic Profitable Tour Problem on a Tree. CoRR abs/2210.11881 (2022) - 2021
- [j30]Enrico Angelelli
A dynamic and probabilistic orienteering problem. Comput. Oper. Res. 136: 105454 (2021) - [j29]Enrico Angelelli
System optimal routing of traffic flows with user constraints using linear programming. Eur. J. Oper. Res. 293(3): 863-879 (2021) - 2020
- [j28]Enrico Angelelli
A matheuristic for the air transportation freight forwarder service problem. Comput. Oper. Res. 123: 105002 (2020) - [j27]Enrico Angelelli
Minimizing the total travel time with limited unfairness in traffic networks. Comput. Oper. Res. 123: 105016 (2020)
2010 – 2019
- 2019
- [j26]Sergio Ortobelli Lozza
Timing portfolio strategies with exponential Lévy processes. Comput. Manag. Sci. 16(1-2): 97-127 (2019) - [j25]Enrico Angelelli
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints. Comput. Oper. Res. 110: 88-100 (2019) - 2018
- [j24]Enrico Angelelli
Congestion avoiding heuristic path generation for the proactive route guidance. Comput. Oper. Res. 99: 234-248 (2018) - 2017
- [j23]Enrico Angelelli
The probabilistic orienteering problem. Comput. Oper. Res. 81: 269-281 (2017) - [j22]Enrico Angelelli
The Traveling Purchaser Problem with time-dependent quantities. Comput. Oper. Res. 82: 15-26 (2017) - 2016
- [j21]Enrico Angelelli
A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19(5): 563-582 (2016) - [j20]Enrico Angelelli
The Stochastic and Dynamic Traveling Purchaser Problem. Transp. Sci. 50(2): 642-658 (2016) - 2014
- [j19]Enrico Angelelli
Optimal interval scheduling with a resource constraint. Comput. Oper. Res. 51: 268-281 (2014) - [j18]Enrico Angelelli
The Clustered Orienteering Problem. Eur. J. Oper. Res. 238(2): 404-414 (2014) - [j17]Enrico Angelelli
Complexity and approximation for Traveling Salesman Problems with profits. Theor. Comput. Sci. 531: 54-65 (2014) - [i1]Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
Reclaimer Scheduling: Complexity and Algorithms. CoRR abs/1402.4178 (2014) - 2012
- [j16]Enrico Angelelli
Kernel Search: a new heuristic framework for portfolio selection. Comput. Optim. Appl. 51(1): 345-361 (2012) - 2011
- [j15]Enrico Angelelli
Look-ahead heuristics for the dynamic traveling purchaser problem. Comput. Oper. Res. 38(12): 1867-1876 (2011) - [j14]Enrico Angelelli
On the complexity of interval scheduling with a resource constraint. Theor. Comput. Sci. 412(29): 3650-3657 (2011) - 2010
- [j13]Enrico Angelelli
Kernel search: A general heuristic for the multi-dimensional knapsack problem. Comput. Oper. Res. 37(11): 2017-2026 (2010) - [j12]Enrico Angelelli
Comparison of policies in dynamic routing problems. J. Oper. Res. Soc. 61(4): 686-695 (2010) - [j11]Enrico Angelelli
Geometric representation for semi on-line scheduling on uniform processors. Optim. Methods Softw. 25(3): 421-428 (2010)
2000 – 2009
- 2009
- [j10]Enrico Angelelli
Exploring greedy criteria for the dynamic traveling purchaser problem. Central Eur. J. Oper. Res. 17(2): 141-158 (2009) - [c1]Enrico Angelelli
Maximum Expected Utility of Markovian Predicted Wealth. ICCS (2) 2009: 588-597 - 2008
- [j9]Enrico Angelelli
Semi-online scheduling on two uniform processors. Theor. Comput. Sci. 393(1-3): 211-219 (2008) - 2007
- [j8]Enrico Angelelli
Competitive analysis for dynamic multiperiod uncapacitated routing problems. Networks 49(4): 308-317 (2007) - [j7]Enrico Angelelli
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Oper. Res. Lett. 35(6): 713-721 (2007) - [j6]Enrico Angelelli
Semi on-line scheduling on three processors with known sum of the tasks. J. Sched. 10(4-5): 263-269 (2007) - 2006
- [j5]Enrico Angelelli
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): 1-16 (2006) - 2004
- [j4]Enrico Angelelli
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. J. Sched. 7(6): 421-428 (2004) - 2003
- [j3]Enrico Angelelli
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. Algorithmica 37(4): 243-262 (2003) - 2002
- [j2]Enrico Angelelli
The periodic vehicle routing problem with intermediate facilities. Eur. J. Oper. Res. 137(2): 233-247 (2002) - [j1]Enrico Angelelli
The application of a vehicle routing model to a waste-collection problem: two case studies. J. Oper. Res. Soc. 53(9): 944-952 (2002)
Coauthor Index
aka: M. Grazia Speranza
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-26 00:50 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: