A reduction approach to the two-campus transport problem
From MaRDI portal
Publication:490382
DOI10.1007/S10951-013-0348-7zbMATH Open1305.90058OpenAlexW1971214483MaRDI QIDQ490382FDOQ490382
Authors: Hagai Ilani, Elad Shufan, Tal Grinshpoun, Aviad Belulu, Alex Fainberg
Publication date: 22 January 2015
Published in: Journal of Scheduling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10951-013-0348-7
Recommendations
Deterministic scheduling theory in operations research (90B35) Transportation, logistics and supply chain management (90B06)
Cites Work
- A note on two problems in connexion with graphs
- On a routing problem
- The vehicle routing problem. Latest advances and new challenges.
- The dial-a-ride problem: Models and algorithms
- Computer-aided complexity classification of dial-a-ride problems
- Shortest paths algorithms: Theory and experimental evaluation
- Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
- A new approach to solve open-partition problems
- A reduction approach to the two-campus transport problem
Cited In (5)
Uses Software
This page was built for publication: A reduction approach to the two-campus transport problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490382)