Pages that link to "Item:Q3705193"
From MaRDI portal
The following pages link to Bounds and Heuristics for Capacitated Routing Problems (Q3705193):
Displayed 50 items.
- Differential approximation algorithm of FSMVRP (Q277103) (← links)
- Approximation schemes for Euclidean vehicle routing problems with time windows (Q346518) (← links)
- The school bus problem on trees (Q378249) (← links)
- A quasipolynomial time approximation scheme for Euclidean capacitated vehicle routing (Q494936) (← links)
- The directed orienteering problem (Q547309) (← links)
- Efficient frameworks for greedy split and new depth first search split procedures for routing problems (Q613510) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← 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)
- Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery (Q850302) (← links)
- Incorporating inventory and routing costs in strategic location models (Q858450) (← links)
- Improved bounds for vehicle routing solutions (Q865747) (← links)
- A note on asymptotic formulae for one-dimensional network flow problems (Q867547) (← links)
- Approximation algorithms for a vehicle routing problem (Q953301) (← links)
- New differential approximation algorithm for \(k\)-customer vehicle routing problem (Q976133) (← links)
- Heuristics for unequal weight delivery problems with a fixed error guarantee (Q1095815) (← links)
- Submodularity and the traveling salesman problem (Q1124707) (← links)
- Topological design of telecommunication networks --- local access design methods (Q1179728) (← links)
- A genetic algorithm for service level based vehicle scheduling (Q1268204) (← links)
- Direct shipping and the dynamic single-depot/multi-retailer inventory system (Q1278988) (← links)
- Topological design of ring networks (Q1318461) (← links)
- The general multi-retailer EOQ problem with vehicle routing costs (Q1342645) (← links)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research (Q1390342) (← links)
- Approximability of the vehicle routing problem in finite-dimensional Euclidean spaces (Q1675324) (← links)
- The dynamic-demand joint replenishment problem with approximated transportation costs (Q1734353) (← links)
- Minimizing customers' waiting time in a vehicle routing problem with unit demands (Q1742415) (← links)
- Worst-case demand distributions in vehicle routing (Q1752215) (← links)
- An approximation algorithm for the traveling tournament problem (Q1761909) (← links)
- Development of a fuel consumption optimization model for the capacitated vehicle routing problem (Q1762131) (← links)
- Approximation algorithms for some vehicle routing problems (Q1765372) (← links)
- On the complexity of the \(k\)-customer vehicle routing problem (Q1886800) (← links)
- The split delivery vehicle scheduling problem with time windows and grid network distances (Q1892675) (← links)
- On properties of geometric random problems in the plane (Q1908291) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- The EMS vehicle patient transportation problem during a demand surge (Q2022301) (← links)
- Approximation algorithms for the load-balanced capacitated vehicle routing problem (Q2043586) (← links)
- Efficient approximation of the metric CVRP in spaces of fixed doubling dimension (Q2046271) (← links)
- Approximation of the capacitated vehicle routing problem with a limited number of routes in metric spaces of fixed doubling dimension (Q2048811) (← links)
- Capacitated vehicle routing problem on line with unsplittable demands (Q2082210) (← 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)
- Polynomial-time approximation scheme for the capacitated vehicle routing problem with time windows (Q2185641) (← links)
- Efficient approximation of the capacitated vehicle routing problem in a metric space of an arbitrary fixed doubling dimension (Q2243777) (← links)
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route (Q2261716) (← links)
- Complexity and approximability of the Euclidean generalized traveling salesman problem in grid clusters (Q2294592) (← links)
- A heuristic for cumulative vehicle routing using column generation (Q2357169) (← links)
- Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem (Q2367016) (← links)
- Planning and approximation models for delivery route based services with price-sensitive demands (Q2370367) (← links)
- The bin packing problem with item fragmentation: a worst-case analysis (Q2414454) (← links)