default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAristide Mingozzi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2018
[j39]Aristide Mingozzi, Roberto Roberti
:
An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns. Transp. Sci. 52(2): 229-238 (2018)- 2016
- [j38]Enrico Bartolini, Lawrence Bodin, Aristide Mingozzi:
The traveling salesman problem with pickup, delivery, and ride-time constraints. Networks 67(2): 95-110 (2016) - 2015
- [j37]Roberto Roberti, Enrico Bartolini, Aristide Mingozzi:
The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation. Manag. Sci. 61(6): 1275-1291 (2015) - 2014
- [j36]Roberto Roberti, Aristide Mingozzi:
Dynamic ng-Path Relaxation for the Delivery Man Problem. Transp. Sci. 48(3): 413-424 (2014) - 2013
- [j35]Aristide Mingozzi, Roberto Roberti, Paolo Toth:
An Exact Algorithm for the Multitrip Vehicle Routing Problem. INFORMS J. Comput. 25(2): 193-207 (2013) - [j34]Roberto Baldacci, Aristide Mingozzi, Roberto Roberti, Roberto Wolfler Calvo:
An Exact Algorithm for the Two-Echelon Capacitated Vehicle Routing Problem. Oper. Res. 61(2): 298-314 (2013) - 2012
- [j33]Roberto Baldacci, Aristide Mingozzi, Roberto Roberti:
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints. Eur. J. Oper. Res. 218(1): 1-6 (2012) - [j32]Roberto Baldacci, Aristide Mingozzi, Roberto Roberti:
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows. INFORMS J. Comput. 24(3): 356-371 (2012) - 2011
- [j31]Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Andrea Valletta:
An Exact Algorithm for the Period Routing Problem. Oper. Res. 59(1): 228-241 (2011) - [j30]Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi:
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows. Oper. Res. 59(2): 414-426 (2011) - [j29]Roberto Baldacci, Aristide Mingozzi, Roberto Roberti:
New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem. Oper. Res. 59(5): 1269-1283 (2011) - [j28]Roberto Baldacci, Aristide Mingozzi, Roberto Wolfler Calvo:
An Exact Method for the Capacitated Location-Routing Problem. Oper. Res. 59(5): 1284-1296 (2011) - 2010
- [j27]Roberto Baldacci, Enrico Bartolini, Aristide Mingozzi, Roberto Roberti:
An exact solution framework for a broad class of vehicle routing problems. Comput. Manag. Sci. 7(3): 229-268 (2010) - 2009
- [j26]Enrico Bartolini, Aristide Mingozzi:
Algorithms for the non-bifurcated network design problem. J. Heuristics 15(3): 259-281 (2009) - [j25]Roberto Baldacci, Aristide Mingozzi:
A unified exact method for solving different classes of vehicle routing problems. Math. Program. 120(2): 347-380 (2009) - 2008
- [j24]Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli:
A dual ascent procedure for the set partitioning problem. Discret. Optim. 5(4): 735-747 (2008) - [j23]Roberto Baldacci, Nicos Christofides, Aristide Mingozzi:
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math. Program. 115(2): 351-385 (2008) - 2007
- [j22]Daniele Vigo, Paolo Toth, Aristide Mingozzi:
Route 2005: Recent advances in vehicle routing optimization. Networks 49(4): 243-244 (2007) - 2006
- [j21]Roberto Baldacci, Lawrence Bodin, Aristide Mingozzi:
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput. Oper. Res. 33: 2667-2702 (2006) - 2004
- [j20]Marco A. Boschetti, Aristide Mingozzi, Salvatore Ricciardelli:
An Exact Algorithm for the Simplified Multiple Depot Crew Scheduling Problem. Ann. Oper. Res. 127(1-4): 177-201 (2004) - [j19]Roberto Baldacci, Vittorio Maniezzo, Aristide Mingozzi:
An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation. Oper. Res. 52(3): 422-439 (2004) - [j18]Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi:
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation. Oper. Res. 52(5): 723-738 (2004) - 2003
- [j17]Marco A. Boschetti, Aristide Mingozzi:
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case. 4OR 1(1): 27-42 (2003) - [j16]Marco A. Boschetti, Aristide Mingozzi:
The Two-Dimensional Finite Bin Packing Problem. Part II: New lower and upper bounds. 4OR 1(2): 135-147 (2003) - [j15]Roberto Baldacci, Eleni Hadjiconstantinou, Aristide Mingozzi:
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections. Networks 42(1): 26-41 (2003) - 2002
- [j14]Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi:
A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29(4): 365-386 (2002) - [j13]Aristide Mingozzi, Serena Morigi:
Partitioning a matrix with non-guillotine cuts to minimize the maximum cos. Discret. Appl. Math. 116(3): 243-260 (2002) - 2000
- [j12]Lawrence Bodin, Aristide Mingozzi, Roberto Baldacci, Michael O. Ball:
The Rollon-Rolloff Vehicle Routing Problem. Transp. Sci. 34(3): 271-288 (2000) - 1999
- [j11]Aristide Mingozzi, Marco A. Boschetti, Salvatore Ricciardelli, Lucio Bianco:
A Set Partitioning Approach to the Crew Scheduling Problem. Oper. Res. 47(6): 873-888 (1999) - [j10]Vittorio Maniezzo, Aristide Mingozzi:
The project scheduling problem with irregular starting time costs. Oper. Res. Lett. 25(4): 175-182 (1999) - [j9]Aristide Mingozzi, Simone Giorgi, Roberto Baldacci:
An Exact Method for the Vehicle Routing Problem with Backhauls. Transp. Sci. 33(3): 315-329 (1999) - 1998
- [j8]Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci:
A Bionomic Approach to the Capacitated p-Median Problem. J. Heuristics 4(3): 263-280 (1998) - 1997
- [j7]Aristide Mingozzi, Lucio Bianco, Salvatore Ricciardelli:
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints. Oper. Res. 45(3): 365-377 (1997) - 1995
- [j6]Eleni Hadjiconstantinou, Nicos Christofides, Aristide Mingozzi:
A new exact algorithm for the vehicle routing problem based onq-paths andk-shortest paths relaxations. Ann. Oper. Res. 61(1): 21-43 (1995) - [j5]Aristide Mingozzi, Salvatore Ricciardelli, Massimo Spadoni:
Partitioning a Matrix to Minimize the Maximum Cost. Discret. Appl. Math. 62(1-3): 221-248 (1995) - 1993
- [j4]Lucio Bianco, Aristide Mingozzi, Salvatore Ricciardelli:
The traveling salesman problem with cumulative costs. Networks 23(2): 81-91 (1993) - 1981
- [j3]Nicos Christofides, Aristide Mingozzi, Paolo Toth:
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math. Program. 20(1): 255-282 (1981) - [j2]Nicos Christofides, Aristide Mingozzi, Paolo Toth:
State-space relaxation procedures for the computation of bounds to routing problems. Networks 11(2): 145-164 (1981) - 1980
- [j1]Nicos Christofides, Aristide Mingozzi, Paolo Toth:
Dynamic Loading and Unloading of Liquids into Tanks. Oper. Res. 28(3-Part-II): 633-649 (1980)
Conference and Workshop Papers
- 2007
- [c3]Enrico Bartolini, Vittorio Maniezzo, Aristide Mingozzi:
An Adaptive Memory-Based Approach Based on Partial Enumeration. LION 2007: 12-24 - 2005
- [c2]Aristide Mingozzi:
The Multi-depot Periodic Vehicle Routing Problem. SARA 2005: 347-350 - 2002
- [c1]Aristide Mingozzi:
State Space Relaxation and Search Strategies in Dynamic Programming. SARA 2002: 51
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-05-08 21:41 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:
