Aristide Mingozzi

Information about the author Aristide Mingozzi will soon be added to the site.

Found 19 papers in total

The traveling salesman problem with pickup, delivery, and ride-time constraints

2016

In the traveling salesman problem with pickup, delivery, and ride‐time...

An Exact Algorithm for the Multitrip Vehicle Routing Problem

2013

The multitrip vehicle routing problem (MTVRP) is a variant of the capacitated vehicle...

An Exact Algorithm for the Pickup and Delivery Problem with Time Windows

2011

The pickup and delivery problem with time windows (PDPTW) is a generalization of the...

An Exact Algorithm for the Period Routing Problem

2011

This paper presents an exact algorithm for solving strategic and tactical multiperiod...

An exact solution framework for a broad class of vehicle routing problems

2010

This paper presents an exact solution framework for solving some variants of the...

An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation

2004

The capacitated vehicle routing problem (CVRP) is the problem in which a set of...

New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem

2002

The two-dimensional orthogonal non-guillotine cutting stock problem (NGCP) appears in...

An exact method for the car pooling problem based on Lagrangean column generation

2004

Car pooling is a transportation service organized by a large company which encourages...

The multiple disposal facilities and multiple inventory locations rollon–rolloff vehicle routing problem

2006

In the multiple disposal facilities and multiple inventory locations...

The project scheduling problem with irregular starting time costs

1999

We consider the problem of scheduling a set of activities satisfying precedence...

An exact algorithm for the simplified multiple depot crew scheduling problem

2004

The Multiple Depot Crew Scheduling Problem (MD-CSP) appears in public transit systems...

New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem

2002

The two-dimensional orthogonal non-guillotine cutting stock problem (NGCP) appears in...

A new method for solving capacitated location problems based on a set partitioning approach

2002

We consider the capacitated p -median problem (CPMP) in which a set of n customers...

An exact method for the vehicle routing problem with backhauls

1999

We consider the problem in which a fleet of vehicles located at a central depot is to...

An exact algorithm for the resource-constrained Project Scheduling Problem based on a new mathematical formulation

1998

In this paper we consider the Project Scheduling Problem with resource constraints,...

A new exact algorithm for the vehicle routing problem based on q-paths and k-shortest paths relaxations

1995

The authors consider the basic Vehicle Routing Problem (VRP) in which a fleet of M...

A heuristic procedure for the crew rostering problem

1992

This paper deals with the problem of planning work schedules in a given time horizon...

Exact and heuristic procedures for the Traveling Salesman Problem with Precedence Constraints, based on dynamic programming

1994

The Traveling Salesman Problem with Precedence Constraints is to find an hamiltonian...

Exact and heuristic algorithms of dynamic programming for combinatorial optimization problem

1991

The main difficulty arising in using dynamic programming to solve combinatorial...

Papers per page: