A reduction approach to the two-campus transport problem
type: Item
instance of: scholarly article
title: A reduction approach to the two-campus transport problem
zbMATH Open document ID: 1305.90058
author: Hagai Ilani
author: Elad Shufan
author: Tal Grinshpoun
author: Aviad Belulu
author: Alex Fainberg
published in: Journal of Scheduling
publication date: 2015-01-22T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6389310
zbMATH Keywords: optimal partition
zbMATH Keywords: transportation scheduling
zbMATH Keywords: DARP
describes a project that uses: DARCLASS
MaRDI profile type: Publication
full work available at URL: s10951-013-0348-7
OpenAlex ID: W1971214483
cites work: On a routing problem
cites work: Technical Note—A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Groupings for Joint Replenishment
cites work: A new approach to solve open-partition problems
cites work: Shortest paths algorithms: Theory and experimental evaluation
cites work: The dial-a-ride problem: Models and algorithms
cites work: A note on two problems in connexion with graphs
cites work: The vehicle routing problem. Latest advances and new challenges.
cites work: Computer-aided complexity classification of dial-a-ride problems
DOI: 10.1007/S10951-013-0348-7
description: scientific article; zbMATH DE number 6389310