Capacitated Vehicle Routing with Nonuniform Speeds

DOI10.1287/moor.2015.0729zbMath1334.90017arXiv1012.1850OpenAlexW2565800384WikidataQ60554340 ScholiaQ60554340MaRDI QIDQ2800377

Marco Molinaro, R. Ravi, Viswanath Nagarajan, Inge Li Gørtz

Publication date: 15 April 2016

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1012.1850

zbMATH Keywords

vehicle routingtraveling salesman problemapproximation algorithms

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Related Items

An approximation algorithm for solving the heterogeneous Chinese postman problem, Vehicle routing with subtours, An approximation algorithm for vehicle routing with compatibility constraints, Approximation algorithms for solving the heterogeneous Chinese postman problem

Uses Software

• VRP

Cites Work

• Unnamed Item
• Min-max tree covers of graphs.
• Approximation algorithms for scheduling unrelated parallel machines
• Improved bounds for vehicle routing solutions
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Balancing minimum spanning trees and shortest-path trees
• Technical Note—Approximation Algorithms for VRP with Stochastic Demands
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Improved algorithms for orienteering and related problems
• Technical Note—Heuristics for Delivery Problems with Constant Error Guarantees
• Bounds and Heuristics for Capacitated Routing Problems
• Guillotine Subdivisions Approximate Polygonal Subdivisions: A Simple Polynomial-Time Approximation Scheme for Geometric TSP, k-MST, and Related Problems
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Approximation Algorithms for Orienteering and Discounted-Reward TSP
• Approximations for minimum and min-max vehicle routing problems