A min-max theorem for the minimum fleet-size problem
Discrete Mathematics
2023-04-07 v2 Computers and Society
Abstract
A retrospective fleet-sizing problem can be solved via bipartite matching, where a maximum cardinality matching corresponds to the minimum number of vehicles needed to cover all trips. We prove a min-max theorem on this minimum fleet-size problem: the maximum number of pairwise incompatible trips is equal to the minimum fleet size needed.
Cite
@article{arxiv.2211.11173,
title = {A min-max theorem for the minimum fleet-size problem},
author = {Tinghan Ye and David Shmoys},
journal= {arXiv preprint arXiv:2211.11173},
year = {2023}
}