Caccetta L.

L. Caccetta

Information about the author L. Caccetta will soon be added to the site.
Found 8 papers in total
An improved branch-and-cut algorithm for the capacitated vehicle routing problem
An improved branch-and-cut algorithm for the capacitated vehicle routing problem
2003
The capacitated vehicle routing problem (CVRP) deals with the distribution of a single...
A branch and cut method for the degree-constrained minimum spanning tree problem
A branch and cut method for the degree-constrained minimum spanning tree problem
2001
A problem of interest in network design is that of finding, in a given weighted graph,...
A survey of reachability and controllability for positive linear systems
A survey of reachability and controllability for positive linear systems
2000
This paper is a survey of reachability and controllability results for discrete-time...
Capacitated vehicle routine problem: Some new cutting planes
Capacitated vehicle routine problem: Some new cutting planes
1998
The Capacitated Vehicle Routing Problem is concerned with the delivery of a single...
A new subtour elimination constraint for the vehicle routing problem
A new subtour elimination constraint for the vehicle routing problem
1996
Vehicle Routing Problems (VRP) are concerned with the delivery of a single commodity...
Solving 0–1 programming problems by a penalty approach
Solving 0–1 programming problems by a penalty approach
1997
In this paper, we discuss the application of a penalty method to the numerical...
Optimum open pit design: A case study
Optimum open pit design: A case study
1991
An important problem in open pit mine planning is that of determining the optimum...
Integer linear programming formulation for a vehicle routing problem
Integer linear programming formulation for a vehicle routing problem
1991
A mixed integer linear programming formulation is given for the vehicle routing...
Papers per page: