GIGAZINE

鉄道・道路・電力などあらゆる種類のネットワークについて最小の ...

スイス連邦工科大学チューリッヒ校のラスムス・キン氏率いる研究チームが鉄道、道路、電力など、あらゆる種類のネットワークにおいて最小のコストで最大の輸送フローを計算するほぼ完璧なアルゴリズムを作成しました。計算速度は、「数学的にこれ ...
EurekAlert!

Researchers at ETH Zurich develop the fastest possible flow algorithm

In a breakthrough that brings to mind Lucky Luke – the man who shoots faster than his shadow – Rasmus Kyng and his team have developed a superfast algorithm that looks set to transform an entire field ...
MSN による配信

Researchers develop the fastest possible flow algorithm

In a breakthrough that brings to mind Lucky Luke—the man who shoots faster than his shadow—Rasmus Kyng and his team have developed a superfast algorithm that looks set to transform an entire field of ...
note

多回転配車のアルゴリズム考察

最初は基本群の「もちあげ」からスタートした。 最後は、ジョブショップ・スケジューリングと同一というところまで突き詰めた。 承知いたしました。これまでの議論を踏まえ、現時点でひらめいたアイデアを元に、配車問題をネットワークフローとして ...
JSTOR Daily

Probabilistic Analysis of Network Flow Algorithms

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...
NextBigFuture

MIT, Yale and USC have a better max-flow algorithm which improve networks and logistics

The maximum-flow problem, or max flow, is one of the most basic problems in computer science. MIT researchers, together with colleagues at Yale and the University of Southern California, have ...