Aristide Mingozzi
According to our database1,
Aristide Mingozzi
authored at least 42 papers
between 1980 and 2018.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2018
An Exact Algorithm for the Fixed Charge Transportation Problem Based on Matching Source and Sink Patterns.
Transp. Sci., 2018
2016
Networks, 2016
2015
The Fixed Charge Transportation Problem: An Exact Algorithm Based on a New Integer Programming Formulation.
Manag. Sci., 2015
2014
2013
Oper. Res., 2013
INFORMS J. Comput., 2013
2012
New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput., 2012
Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints.
Eur. J. Oper. Res., 2012
2011
Oper. Res., 2011
Oper. Res., 2011
2010
Comput. Manag. Sci., 2010
2009
Math. Program., 2009
2008
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts.
Math. Program., 2008
2007
Proceedings of the Learning and Intelligent Optimization, Second International Conference, 2007
2006
The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem.
Comput. Oper. Res., 2006
2005
Proceedings of the Abstraction, 2005
2004
Oper. Res., 2004
An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation.
Oper. Res., 2004
Ann. Oper. Res., 2004
2003
An exact algorithm for the Traveling Salesman Problem with Deliveries and Collections.
Networks, 2003
4OR, 2003
The two-dimensional finite bin packing problem. Part I: New lower bounds for the oriented case.
4OR, 2003
2002
Discret. Appl. Math., 2002
A new method for solving capacitated location problems based on a set partitioning approach.
Comput. Oper. Res., 2002
Proceedings of the Abstraction, 2002
2000
1999
Oper. Res. Lett., 1999
1998
1997
Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints.
Oper. Res., 1997
1995
A new exact algorithm for the vehicle routing problem based on<i>q</i>-paths and<i>k</i>-shortest paths relaxations.
Ann. Oper. Res., 1995
1993
1981
Networks, 1981
Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations.
Math. Program., 1981
1980