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

11/21/2022
by   Tinghan Ye, et al.
0

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.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset