Approximating Capacitated Routing and Delivery Problems
From MaRDI portal
Recommendations
Cited in
(41)- On the one-commodity pickup-and-delivery traveling salesman problem with stochastic demands
- Approximation algorithms for maximum latency and partial cycle cover
- Better approximations for max TSP
- Approximating the maximum quadratic assignment problem
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
- Polynomially solvable cases of the bipartite traveling salesman problem
- Solving the shortest route cut and fill problem using simulated annealing
- A general variable neighborhood search for the one-commodity pickup-and-delivery travelling salesman problem
- Cable tree wiring -- benchmarking solvers on a real-world scheduling problem with a variety of precedence constraints
- The single line moving target traveling salesman problem with release times
- The \(k\)-delivery traveling salesman problem: revisited
- The pyramidal capacitated vehicle routing problem
- An approximation algorithm for vehicle routing with compatibility constraints
- A truck scheduling problem arising in intermodal container transportation
- An algorithm for the one commodity pickup and delivery traveling salesman problem with restricted depot
- An improved randomized approximation algorithm for Max TSP
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Algorithms for capacitated vehicle routing
- The multi-commodity pickup-and-delivery traveling salesman problem
- Vehicle Routing Algorithms for Radially Escaping Targets
- k-delivery traveling salesman problem on tree networks
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
- Balancing the stations of a self service ``bike hire system
- Solving capacitated part-routing problems with setup times and costs: a Dantzig-Wolfe decomposition-based solution approach
- The preemptive swapping problem on a tree
- A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem
- Bounds and Heuristics for Capacitated Routing Problems
- An experimental study of a hybrid genetic algorithm for the maximum traveling salesman problem
- Restricted delivery problems on a network
- Polynomial time approximation schemes for the constrained minimum spanning tree problem
- scientific article; zbMATH DE number 1775420 (Why is no real title available?)
- A branch-and-cut algorithm for the nonpreemptive swapping problem
- Theoretical Computer Science
- Improving the approximation ratio for capacitated vehicle routing
- The vehicle routing problem with pickups and deliveries on some special graphs
- Bike rebalancing: how to find a balanced matching in the k center problem?
- Vector TSP: a traveling salesperson problem with racetrack-like acceleration constraints
- Heuristics for the mixed swapping problem
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
- A hybrid GRASP/VND heuristic for the one-commodity pickup-and-delivery traveling salesman problem
This page was built for publication: Approximating Capacitated Routing and Delivery Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4268861)
