An approximation algorithm for vehicle routing with compatibility constraints
From MaRDI portal
Recommendations
- Approximation algorithms for some vehicle routing problems
- Approximation algorithms for a vehicle routing problem
- Approximation Algorithms for Conflict-Free Vehicle Routing
- Approximation algorithms for distance constrained vehicle routing problems
- Exact algorithms for routing problems under vehicle capacity constraints
- Approximation algorithms for the load-balanced capacitated vehicle routing problem
- Minimum makespan vehicle routing problem with compatibility constraints
- Approximations for minimum and min-max vehicle routing problems
- Exact algorithms for the multi-compartment vehicle routing problem with flexible compartment sizes
Cites work
- scientific article; zbMATH DE number 1256763 (Why is no real title available?)
- A Greedy Heuristic for the Set-Covering Problem
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
- Algorithms for capacitated vehicle routing
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
- An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
- An approximation algorithm for vehicle routing with compatibility constraints
- Analytical approach to parallel repetition
- Approximating Capacitated Routing and Delivery Problems
- Approximation algorithms for deadline-TSP and vehicle routing with time-windows
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Approximations for minimum and min-max vehicle routing problems
- Capacitated vehicle routing with nonuniform speeds
- Improved algorithms for orienteering and related problems
- Min-max tree covers of graphs.
- Minimum makespan vehicle routing problem with compatibility constraints
- Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
- Solution of a min-max vehicle routing problem
- Solving min-max multi-depot vehicle routing problem
- The dial-a-ride problem: Models and algorithms
- The orienteering problem
- The prize collecting traveling salesman problem
- The traveling salesman problem. A computational study.
- The vehicle routing problem. Latest advances and new challenges.
- Vehicle Routing
Cited in
(5)- An approximation algorithm for vehicle routing with compatibility constraints
- Approximation Algorithms for Conflict-Free Vehicle Routing
- Minimum makespan vehicle routing problem with compatibility constraints
- Time window optimization for attended home service delivery under multiple sources of uncertainties
- Approximation algorithms for a vehicle routing problem
This page was built for publication: An approximation algorithm for vehicle routing with compatibility constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2294242)
