The following pages link to Daniele Vigo (Q322877):
Displaying 50 items.
- (Q296699) (redirect page) (← links)
- A multi-start algorithm for a balanced real-world open vehicle routing problem (Q296700) (← links)
- An optimization approach for district heating strategic network design (Q322878) (← links)
- The hybrid electric vehicle-traveling salesman problem (Q323259) (← links)
- A service network design model for multimodal municipal solid waste transport (Q323286) (← links)
- An iterated local search for the multi-commodity multi-trip vehicle routing problem with time windows (Q337147) (← links)
- Recent advances on two-dimensional bin packing problems (Q697576) (← links)
- Models, relaxations and exact approaches for the capacitated vehicle routing problem (Q697581) (← links)
- TSpack: A unified tabu search code for multi-dimensional bin packing problems (Q702723) (← links)
- Lower bounds and heuristics for the windy rural postman problem (Q852946) (← links)
- Recent advances in vehicle routing exact algorithms (Q926561) (← links)
- Exact algorithms for routing problems under vehicle capacity constraints (Q970191) (← links)
- An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem (Q1025258) (← links)
- Analysis of supply chains with quantity based fixed incentives (Q1038401) (← links)
- A heuristic algorithm for the symmetric and asymmetric vehicle routing problems with backhauls (Q1124810) (← links)
- A heuristic algorithm for the asymmetric capacitated vehicle routing problem (Q1266654) (← links)
- Heuristics for the traveling salesman problem with pickup and delivery (Q1302721) (← links)
- A lower bound for the non-oriented two-dimensional bin packing problem (Q1348248) (← links)
- Algorithms for railway crew management (Q1365052) (← links)
- A tabu search algorithm for the open shop problem (Q1383321) (← links)
- Exact and heuristic algorithms for data sets reconstruction (Q1576347) (← links)
- A stochastic programming model for a tactical solid waste management problem (Q1622822) (← links)
- Visual attractiveness in routing problems: a review (Q1634050) (← links)
- An efficient implementation of a static move descriptor-based local search heuristic (Q1652594) (← links)
- A multi-depot two-echelon vehicle routing problem with delivery options arising in the last mile distribution (Q1681304) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles (Q1752844) (← links)
- Metaheuristics for the traveling salesman problem with pickups, deliveries and handling costs (Q1762084) (← links)
- Approximation algorithm for the oriented two-dimensional bin packing problem (Q1806892) (← links)
- Heuristic algorithms for the three-dimensional bin packing problem (Q1847192) (← links)
- Models and bounds for two-dimensional level packing problems (Q1888172) (← links)
- Minimizing the sum of weighted completion times with unrestricted weights (Q1902889) (← links)
- An exact algorithm for the capacitated shortest spanning arborescence (Q1908299) (← links)
- The multiple traveling salesman problem in presence of drone- and robot-supported packet stations (Q2098034) (← links)
- The hybrid electric vehicle-traveling salesman problem with time windows (Q2178092) (← links)
- A branch-and-cut-and-price algorithm for the multi-trip separate pickup and delivery problem with time windows at customers and facilities (Q2315637) (← links)
- A genetic/tabu thresholding hybrid algorithm for the process allocation problem (Q2567844) (← links)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
- Guidelines for the computational testing of machine learning approaches to vehicle routing problems (Q2670511) (← links)
- Solving TSP through the Integration of OR and CP Techniques (Q2741259) (← links)
- Modeling and Solving the Crew Rostering Problem (Q2781158) (← links)
- A Survey of Optimization Models for Train Routing and Scheduling (Q2783827) (← links)
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem (Q2783932) (← links)
- An Exact Approach to the Strip-Packing Problem (Q2884561) (← links)
- The Granular Tabu Search and Its Application to the Vehicle-Routing Problem (Q2884563) (← links)
- Valid inequalities for the fleet size and mix vehicle routing problem with fixed costs (Q3057117) (← links)
- (Q3059312) (← links)
- (Q3145801) (← links)
- Exact Algorithms for the Clustered Vehicle Routing Problem (Q5166298) (← links)
- Erratum to “The Three-Dimensional Bin Packing Problem”: Robot-Packable and Orthogonal Variants of Packing Problems (Q5322133) (← links)
