A min-max theorem for the minimum fleet-size problem

DOI10.1016/J.ORL.2023.03.013zbMath1525.90079arXiv2211.11173WikidataQ123016857 ScholiaQ123016857MaRDI QIDQ6106544

David B. Shmoys, Tinghan Ye

Publication date: 3 July 2023

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2211.11173

zbMATH Keywords

bipartite matchingmin-max theoremminimum fleet-size problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)

Cites Work

• Optimization for dynamic ride-sharing: a review

This page was built for publication: A min-max theorem for the minimum fleet-size problem