Multi-candidate carpooling routing problem and its approximation algorithms

DOI10.1007/978-3-031-49611-0_27MaRDI QIDQ6606200

Guihai Chen, Zifeng Liu, Jia-Le Zhang, Xiuqi Huang, Xiaofeng Gao

Publication date: 16 September 2024

zbMATH Keywords

TSPapproximationexact algorithmcarpooling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximations for TSP with simple precedence constraints
• Solving the equality generalized traveling salesman problem using the Lin-Kernighan-Helsgaun algorithm
• An ensemble of discrete differential evolution algorithms for solving the generalized traveling salesman problem
• Analysis of Christofides' heuristic: some paths are more difficult than cycles
• Approximation schemes for the generalized traveling salesman problem
• Car-sharing problem: online scheduling with flexible advance bookings
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• A Polylogarithmic Approximation Algorithm for the Group Steiner Tree Problem
• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• A 1.5-Approximation for Path TSP
• A PTAS for planar group Steiner tree via spanner bootstrapping and prize collecting
• The Traveling-Salesman Problem and Minimum Spanning Trees
• Automata, Languages and Programming
• A deterministic better-than-3/2 approximation algorithm for metric TSP
• New neighborhoods and an iterated local search algorithm for the generalized traveling salesman problem

This page was built for publication: Multi-candidate carpooling routing problem and its approximation algorithms