An approximation algorithm for vehicle routing with compatibility constraints

DOI10.1016/j.orl.2018.10.002zbMath1476.90066OpenAlexW2896032967WikidataQ129099083 ScholiaQ129099083MaRDI QIDQ2294242

Siqian Shen, Miao Yu, Viswanath Nagarajan

Publication date: 10 February 2020

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2018.10.002

zbMATH Keywords

vehicle routingapproximation algorithmminimum makespan

Mathematics Subject Classification ID

Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Deterministic network models in operations research (90B10)

Related Items (2)

An approximation algorithm for vehicle routing with compatibility constraints ⋮ Time window optimization for attended home service delivery under multiple sources of uncertainties

Uses Software

• VRP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Min-max tree covers of graphs.
• The vehicle routing problem. Latest advances and new challenges.
• An adaptive memory heuristic for a class of vehicle routing problems with minmax objective
• Minimum makespan vehicle routing problem with compatibility constraints
• An approximation algorithm for vehicle routing with compatibility constraints
• An approximation algorithm for a symmetric generalized multiple depot, multiple travelling salesman problem
• The dial-a-ride problem: Models and algorithms
• A \(2+\varepsilon\) approximation algorithm for the \(k\)-MST problem
• Algorithms for Capacitated Vehicle Routing
• Capacitated Vehicle Routing with Nonuniform Speeds
• Solution of a Min-Max Vehicle Routing Problem
• Vehicle Routing
• Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
• Improved algorithms for orienteering and related problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Saving an epsilon
• The orienteering problem
• The prize collecting traveling salesman problem
• A Greedy Heuristic for the Set-Covering Problem
• Approximating Capacitated Routing and Delivery Problems
• A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
• Analytical approach to parallel repetition
• 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

This page was built for publication: An approximation algorithm for vehicle routing with compatibility constraints