The following pages link to Daniele Vigo (Q322877):
Displaying 26 items.
- An Exact Algorithm for the Vehicle Routing Problem with Backhauls (Q4233781) (← links)
- A Branch-and-Bound Algorithm for the Capacitated Vehicle Routing Problem on Directed Graphs (Q4319767) (← links)
- A branch-and-cut algorithm for the resource-constrained minimum-weight arborescence problem (Q4345574) (← links)
- (Q4350083) (← links)
- (Q4350084) (← links)
- (Q4353005) (← links)
- Heuristic Algorithms for the Handicapped Persons Transportation Problem (Q4367065) (← links)
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems (Q4427380) (← links)
- (Q4495176) (← links)
- The Three-Dimensional Bin Packing Problem (Q4530648) (← links)
- (Q4532223) (← links)
- (Q4532224) (← links)
- (Q4532230) (← links)
- (Q4699368) (← links)
- (Q4955264) (← links)
- Exact Algorithms for the Clustered Vehicle Routing Problem (Q5166298) (← links)
- (Q5271463) (← links)
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems (Q5322133) (← links)
- Erratum—Exact Algorithms for the Clustered Vehicle Routing Problem (Q5740222) (← links)
- Comments on: ``Disruption management in vehicle routing and scheduling for road freight transport: a review'' (Q5970321) (← links)
- Effective metaheuristics for the latency location routing problem (Q6080614) (← links)
- Operational Research: Methods and Applications (Q6509328) (← links)
- Routing one million customers in a handful of minutes (Q6551178) (← links)
- Waste collection routing: a survey on problems and methods (Q6558657) (← links)
- Instances for the multiple Traveling Salesman Problem with Drone Stations (mTSP-DS) (Q6709540) (← links)
- A rolling horizon heuristic approach for a multi-stage stochastic waste collection problem (Q6729811) (← links)
