Approximation algorithms for some extensions of the maximum profit routing problem

DOI10.1007/s10878-022-00944-0OpenAlexW4311653224MaRDI QIDQ2105889

Bogdan Armaselu

Publication date: 8 December 2022

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-022-00944-0

zbMATH Keywords

routingAPXmaximum-profitmultiple vehiclesvariable supply

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27)

Uses Software

• GitHub

Cites Work

• New inapproximability bounds for TSP
• Combined vehicle routing and scheduling with temporal precedence and synchronization constraints
• Constant-factor approximations for capacitated arc routing without triangle inequality
• Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
• Approximation algorithms for deadline-TSP and vehicle routing with time-windows
• Capacitated arc routing problems
• P-Complete Approximation Problems
• Vehicle Routing with Time Windows: Two Optimization Algorithms
• The Traveling Salesman Problem with Distances One and Two
• Faster Pseudopolynomial Time Algorithms for Subset Sum