Capacitated Vehicle Routing on Trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1303035
- Modeling and solving the capacitated vehicle routing problem on trees
- A PTAS for Capacitated Vehicle Routing on Trees
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- scientific article; zbMATH DE number 1522939
- A framework for vehicle routing approximation schemes in trees
- A tight 4/3 approximation for capacitated vehicle routing in trees
- On the capacitated vehicle routing problem
- Approximating capacitated tree-routings in networks
- Approximating Capacitated Tree-Routings in Networks
Cited in
(55)- Exploiting sparsity in pricing routines for the capacitated arc routing problem
- Branch-and-bound algorithms for the multi-product assembly line balancing problem
- BISON: A fast hybrid procedure for exactly solving the one-dimensional bin packing problem
- Lower bounds for a bin packing problem with linear usage cost
- An analysis of lower bound procedures for the bin packing problem
- The split delivery vehicle scheduling problem with time windows and grid network distances
- Routing problems: A bibliography
- The single vehicle routing problem with toll-by-weight scheme: a branch-and-bound approach
- Tree partitioning under constraints. -- Clustering for vehicle routing problems
- Bin packing problem with conflicts and item fragmentation
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Capacitated vehicle routing problem on line with unsplittable demands
- Packing-based branch-and-bound for discrete malleable task scheduling
- A tight approximation algorithm for multi-vehicle CVRP with unsplittable demands on a line
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- Improved approximations for capacitated vehicle routing with unsplittable client demands
- Improved approximation algorithms for cumulative VRP with stochastic demands
- An analytical bound on the fleet size in vehicle routing problems: a dynamic programming approach
- SALSA: combining branch-and-bound with dynamic programming to smoothen workloads in simple assembly line balancing
- A PTAS for bounded-capacity vehicle routing in planar graphs
- A three-dimensional bin-packing model: exact multicriteria solution and computational complexity
- State-of-the-art exact and heuristic solution procedures for simple assembly line balancing
- Computing the asymptotic worst-case of bin packing lower bounds
- Approximation algorithms for cumulative VRP with stochastic demands
- Approximation algorithms for distance constrained vehicle routing problems
- The preemptive swapping problem on a tree
- Selecting Good a Priori Sequences for Vehicle Routing Problem with Stochastic Demand
- Heuristics for vehicle routing on tree-like networks
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Modeling and solving the capacitated vehicle routing problem on trees
- The school bus problem on trees
- Two exact algorithms for the vehicle routing problem on trees
- scientific article; zbMATH DE number 1303035 (Why is no real title available?)
- Optimal Solution of Vehicle Routing Problems Using Minimum K-Trees
- A tight 4/3 approximation for capacitated vehicle routing in trees
- A fast (2 + 2/7)-approximation algorithm for capacitated cycle covering
- Bounds for the general capacitated routing problem
- Balancing profits and costs on trees
- Approximating Capacitated Tree-Routings in Networks
- Improving the approximation ratio for capacitated vehicle routing
- Improving the approximation ratio for capacitated vehicle routing
- Bounds for the cardinality constrained \(P \|C_{max}\) problem
- A new approximation algorithm for the capacitated vehicle routing problem on a tree
- A PTAS for Capacitated Vehicle Routing on Trees
- Approximation Schemes for Capacitated Vehicle Routing on Graphs of Bounded Treewidth, Bounded Doubling, or Highway Dimension
- A new destructive bounding scheme for the bin packing problem
- Minimizing the maximum flow time in the online food delivery problem
- A polynomial-time exact algorithm for k-depot capacitated vehicle routing problem on a tree
- Vehicle routing for connected service areas -- a versatile approach covering single, hierarchical, and bi-criteria objectives
- Improved approximations for the capacitated vehicle routing problem with fixed capacity
- A tight (1.5+)-approximation for unsplittable capacitated vehicle routing on trees
- An approximation algorithm for the pickup and delivery vehicle routing problem on trees
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- New bin packing fast lower bounds
- On the approximation of the generalized capacitated tree-routing problem
This page was built for publication: Capacitated Vehicle Routing on Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3980515)
