On the shared transportation problem: computational hardness and exact approach
From MaRDI portal
Publication:6610092
DOI10.1142/s0129054123410058MaRDI QIDQ6610092
Tom Davot, Rodolphe Giroudeau, Jean-Claude Konig
Publication date: 24 September 2024
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Abstract computational complexity for mathematical programming problems (90C60) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
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
- Parameterized Algorithms
- On the complexity of \(k\)-SAT
This page was built for publication: On the shared transportation problem: computational hardness and exact approach
