Complexity and approximation results on the shared transportation problem

DOI10.1007/978-3-030-92681-6_12OpenAlexW4205841255MaRDI QIDQ2149862

Rodolphe Giroudeau, Tom Davot, Jean-Claude Konig

Publication date: 29 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_12

zbMATH Keywords

complexityapproximationlist edge coloring

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Solving the minimum label spanning tree problem by mathematical programming techniques
• A mixed integer linear formulation for the minimum label spanning tree problem
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• On the minimum label spanning tree problem
• Which problems have strongly exponential complexity?
• Computing and listing \(st\)-paths in public transportation networks
• Graph edge coloring: a survey
• The parameterized complexity of some minimum label problems
• Optimization for dynamic ride-sharing: a review
• Approximation algorithms and hardness results for labeled connectivity problems
• The dial-a-ride problem: Models and algorithms
• On the hardness of approximating minimization problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• On the complexity of \(k\)-SAT

This page was built for publication: Complexity and approximation results on the shared transportation problem