On the shared transportation problem: computational hardness and exact approach

DOI10.1142/S0129054123410058MaRDI QIDQ6610092zbMATH OpenFDO

Authors Tom Davot, Rodolphe Giroudeau, Jean-Claude König

Publication date 24 September 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129054123410058

zbMATH Keywords

approximationcomplexitylist edge coloring

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Approximate ridesharing of personal vehicles problem
• Ride Sharing with a Vehicle of Unlimited Capacity.
• Algorithmic Analysis for Ridesharing of Personal Vehicles
• Algorithmic analysis for ridesharing of personal vehicles
• Approximate ridesharing of personal vehicles problem

Cites work

• A mixed integer linear formulation for the minimum label spanning tree problem
• Approximation algorithms and hardness results for labeled connectivity problems
• Computing and listing \(st\)-paths in public transportation networks
• Graph edge coloring: a survey
• scientific article; zbMATH DE number 1953201 (Why is no real title available?)
• scientific article; zbMATH DE number 2147947 (Why is no real title available?)
• Lower bounds based on the exponential time hypothesis
• On the complexity of k-SAT
• On the hardness of approximating minimization problems
• On the minimum label spanning tree problem
• Optimization for dynamic ride-sharing: a review
• Parameterized algorithms
• Solving the minimum label spanning tree problem by mathematical programming techniques
• The dial-a-ride problem (DARP): variants, modeling issues and algorithms
• The dial-a-ride problem: Models and algorithms
• The parameterized complexity of some minimum label problems
• Which problems have strongly exponential complexity?

This page was built for publication: On the shared transportation problem: computational hardness and exact approach

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