← 研踪 PaperTrailarXiv:2610.37065 · v1
Polynomial-Time Solvability of the Mixed Evacuation Problem
首次提交 2026-10-27 19:32
版本更新 2026-10-27 19:32
雷达观测 2026-10-29 00:35
摘要
The mixed evacuation problem is a variant of the dynamic transshipment problem where there exist two modes of transportation and we allocate supplies to each mode of transportation in such a way that we can send all the supplies from sources to sinks within a given time limit. It is known that this problem can be solved in polynomial time when the number of sources and sinks is small. In this paper, we prove that the mixed evacuation problem can be solved in polynomial time with the ellipsoid method.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-10-27 19:32 · 最新观测版本
Polynomial-Time Solvability of the Mixed Evacuation Problem
The mixed evacuation problem is a variant of the dynamic transshipment problem where there exist two modes of transportation and we allocate supplies to each mode of transportation in such a way that we can send all the supplies from sources to sinks within a given time limit. It is known that this problem can be solved in polynomial time when the number of sources and sinks is small. In this paper, we prove that the mixed evacuation problem can be solved in polynomial time with the ellipsoid method.
查看此版本解读 →查看此版本原文 ↗