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.
翻译:车队的回溯性问题可以通过双方配对来解决,在这种配对中,最大基点匹配与所有旅行所需的最低车辆数量相对应。 我们证明关于这一最低车队规模问题的最起码理论:双向不相容旅行的最大次数相当于所需的最低车队规模。