← 研踪 PaperTrailarXiv:2611.07369 · v1
A Simple Discrete Newton Method for the Quickest Transshipment Problem
首次提交 2026-11-05 11:15
版本更新 2026-11-05 11:15
雷达观测 2026-11-06 10:04
摘要
The quickest transshipment problem is a problem defined in a dynamic network with multiple sources and multiple sinks. The goal of this problem is to send all the supplies from sources to sinks as quickly as possible. It is known that this problem can be solved in polynomial time. In particular, Schlöter, Skutella, and Tran proposed a strongly polynomial-time discrete Newton method for this problem. In this paper, we propose a simple polynomial-time discrete Newton method for the quickest transshipment problem.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-05 11:15 · 最新观测版本
A Simple Discrete Newton Method for the Quickest Transshipment Problem
The quickest transshipment problem is a problem defined in a dynamic network with multiple sources and multiple sinks. The goal of this problem is to send all the supplies from sources to sinks as quickly as possible. It is known that this problem can be solved in polynomial time. In particular, Schlöter, Skutella, and Tran proposed a strongly polynomial-time discrete Newton method for this problem. In this paper, we propose a simple polynomial-time discrete Newton method for the quickest transshipment problem.
查看此版本解读 →查看此版本原文 ↗