Pages that link to "Item:Q3211137"
From MaRDI portal
The following pages link to Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees (Q3211137):
Displaying 33 items.
- Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs (Q326228) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- A hybrid fuzzy-optimization approach to customer grouping-based logistics distribution operations (Q938004) (← links)
- Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- Analysis of heuristics for the design of tree networks (Q1197773) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- A fuzzy-based customer classification method for demand-responsive logistical distribution operations. (Q1413870) (← links)
- Optimization of printed circuit board manufacturing: Integrated modeling and algorithms (Q1577779) (← links)
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem (Q1762131) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← links)
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- Routing vehicles to minimize fuel consumption (Q2450732) (← links)
- On the tour partitioning heuristic for the unit demand capacitated vehicle routing problem (Q2467480) (← links)
- Capacitated vehicle routing with nonuniform speeds (Q2800377) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Approximation results for min-max path cover problems in vehicle routing (Q3065634) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- Online Vehicle Routing Problems: A Survey (Q3564358) (← links)
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469) (← links)
- Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries (Q4700651) (← links)
- Analyses of advanced iterated tour partitioning heuristics for generalized vehicle routing problems (Q5326795) (← links)
- Probabilistic Analysis of Unit-Demand Vehicle Routeing Problems (Q5443715) (← links)
- Iterated tour partitioning for Euclidean capacitated vehicle routing (Q6076221) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Improved approximation algorithms for multidepot capacitated vehicle routing (Q6591657) (← links)
