default search action
Enrico Bartolini
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Mengdie Ye
, Enrico Bartolini, Michael Schneider:
A general variable neighborhood search for the traveling salesman problem with time windows under various objectives. Discret. Appl. Math. 346: 95-114 (2024) - 2023
- [j16]Maximilian Löffler
A conceptually simple algorithm for the capacitated location-routing problem. EURO J. Comput. Optim. 11: 100063 (2023) - 2021
- [j15]Alberto Santini
The crop growth planning problem in vertical farming. Eur. J. Oper. Res. 294(1): 377-390 (2021) - [j14]Enrico Bartolini
The Robust Traveling Salesman Problem with Time Windows Under Knapsack-Constrained Travel Time Uncertainty. Transp. Sci. 55(2): 371-394 (2021) - 2020
- [j13]Enrico Bartolini, Michael Schneider:
A two-commodity flow formulation for the capacitated truck-and-trailer routing problem. Discret. Appl. Math. 275: 3-18 (2020)
2010 – 2019
- 2019
- [j12]Juho Andelmin
A multi-start local search heuristic for the Green Vehicle Routing Problem based on a multigraph reformulation. Comput. Oper. Res. 109: 43-63 (2019) - 2017
- [j11]Enrico Bartolini, Mauro Dell'Amico
Scheduling cleaning activities on trains by minimizing idle times. J. Sched. 20(5): 493-506 (2017) - [j10]Juho Andelmin
An Exact Algorithm for the Green Vehicle Routing Problem. Transp. Sci. 51(4): 1288-1303 (2017) - 2016
- [j9]Enrico Bartolini, Lawrence Bodin, Aristide Mingozzi:
The traveling salesman problem with pickup, delivery, and ride-time constraints. Networks 67(2): 95-110 (2016) - 2015
- [j8]Roberto Roberti
The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation. Manag. Sci. 61(6): 1275-1291 (2015) - 2013
- [j7]Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte:
An Exact Algorithm for the Capacitated Arc Routing Problem with Deadheading Demand. Oper. Res. 61(2): 315-327 (2013) - [j6]Enrico Bartolini, Jean-François Cordeau, Gilbert Laporte:
Improved lower bounds and exact algorithm for the capacitated arc routing problem. Math. Program. 137(1-2): 409-452 (2013) - 2011
- [j5]Roberto Baldacci
An Exact Algorithm for the Period Routing Problem. Oper. Res. 59(1): 228-241 (2011) - [j4]Roberto Baldacci
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Oper. Res. 59(2): 414-426 (2011) - 2010
- [j3]Roberto Baldacci
An exact solution framework for a broad class of vehicle routing problems. Comput. Manag. Sci. 7(3): 229-268 (2010) - [j2]Roberto Baldacci
Some applications of the generalized vehicle routing problem. J. Oper. Res. Soc. 61(7): 1072-1077 (2010)
2000 – 2009
- 2009
- [b1]Enrico Bartolini:
Algorithms for network design and routing problems. University of Bologna, Italy, 2009 - [j1]Enrico Bartolini, Aristide Mingozzi:
Algorithms for the non-bifurcated network design problem. J. Heuristics 15(3): 259-281 (2009) - 2007
- [c1]Enrico Bartolini, Vittorio Maniezzo
An Adaptive Memory-Based Approach Based on Partial Enumeration. LION 2007: 12-24
Coauthor Index
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-06-10 20:31 CEST 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: