Minimum Vehicle Routing with a Common Deadline

DOI10.1007/11830924_21MaRDI QIDQ3595416zbMATH OpenOpenAlexFDO

Authors Viswanath Nagarajan, R. Ravi

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_21

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Approximations for minimum and min-max vehicle routing problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
• Approximation results for min-max path cover problems in vehicle routing
• Vehicle routing with subtours

Cited in

(7)

• Min-max cover of a graph with a small number of parts
• Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
• New LP relaxations for minimum cycle/path/tree cover problems
• Star routing: between vehicle routing and vertex cover
• Approximation algorithms for distance constrained vehicle routing problems
• Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
• New approximation algorithms for the minimum cycle cover problem

This page was built for publication: Minimum Vehicle Routing with a Common Deadline

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595416)