Pages that link to "Item:Q1095815"
From MaRDI portal
The following pages link to Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815):
Displaying 32 items.
- Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution (Q684320) (← links)
- Minimizing latency of capacitated \(k\)-tours (Q724250) (← links)
- A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands (Q783689) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← 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)
- Topological design of ring networks (Q1318461) (← links)
- Vehicle routing with split deliveries (Q1327209) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line (Q2109294) (← links)
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering (Q2118143) (← links)
- Improved approximations for capacitated vehicle routing with unsplittable client demands (Q2164702) (← links)
- Improved approximation algorithms for cumulative VRP with stochastic demands (Q2181250) (← links)
- A new heuristic for the fleet size and mix vehicle routing problem (Q2276859) (← links)
- Survivable network design: the capacitated minimum spanning network problem (Q2390307) (← links)
- Routing vehicles to minimize fuel consumption (Q2450732) (← links)
- Approximation Algorithms for Cumulative VRP with Stochastic Demands (Q2795944) (← links)
- Capacitated Vehicle Routing with Nonuniform Speeds (Q2800377) (← links)
- Capacitated Vehicle Routing with Non-uniform Speeds (Q3009766) (← links)
- Split delivery routing (Q3035116) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand (Q3105744) (← links)
- Routing a Heterogeneous Fleet of Vehicles (Q3564347) (← links)
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem (Q4008469) (← links)
- A Fast $$(2 + 2/7)$$-Approximation Algorithm for Capacitated Cycle Covering (Q5041760) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5918417) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- Matheuristics with performance guarantee for the unsplit and split delivery capacitated vehicle routing problem (Q6085887) (← links)
- Improved approximation algorithms for multidepot capacitated vehicle routing (Q6591657) (← links)