arrow
返回

A strongly polynomial Contraction-Expansion algorithm for network flow problems

delete2017-08-01
delete3
PRE
AI
J
Jean Bertrand Gauthier *
J
Jacques Desrosiers
M
Marco E. Lübbecke
DOI:10.1016/j.cor.2017.02.019delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
This paper addresses the solution of the capacitated minimum cost flow problem on a network containing n nodes and m arcs. Satisfying necessary and sufficient optimality conditions can be done on the residual network although it can be quite time consuming as testified by the minimum mean cycle canceling algorithm (MMCC). We introduce a contracted network which exploits these conditions on a much smaller network. Since the construction of this contracted network is very flexible, we study its properties depending on the construction choice. A generic contraction algorithm is then produced around the contracted network. Interestingly enough, it turns out it encapsulates both the MMCC and primal network simplex algorithms as extreme cases. By guiding the solution using a particular expansion scheme, we are able to recuperate theoretical results from MMCC. As such, we obtain a strongly polynomial Contraction-Expansion algorithm which runs in O(m(3)n(2)) time. There is thus no improvement of the runtime complexity, yet the expansion scheme sticks to very practical observations of MMCC's behavior, namely that of phases and jumps on the optimality parameter. The solution time is ultimately significantly reduced, even more so as the size of the instance increases. (C) 2017 Elsevier Ltd. All rights reserved.
Keyword:
Network flow problem
Residual network
Contracted network
Minimum mean cost cycle
Complexity analysis
Strongly polynomial algorithm
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

C
Computers and Operations Research
IF:
4.3
论文数:
6.5K
被引数:
1.8W

机构

H
HEC Montreal
学者数:
860
论文数: 944
被引数: 6
U
universite de montreal
学者数:
4.6W
论文数: 3.8W
被引数: 46
引用论文

引用论文

err分享
err收藏
Sex Steroid Receptors in Hodgkin's Disease
err2009-07-01
err0
PREAI
errDiane M. Maia; Janiece Sciarrotta; Karin Abendroth; Julie Blatt
err分享
err收藏
err分享
err收藏
About the minimum mean cycle-canceling algorithm
err2015-12-01
err0
errOAAI
errJean Bertrand Gauthier; Jacques Desrosiers; Marco E. Lübbecke
err分享
err收藏
Implementation of a Dual Affine Interior Point Algorithm for Linear Programming
err1989-11-01
err0
PREAI
errRoy E. Marsten; Matthew J. Saltzman; David F. Shanno; George S. Pierce; J. F. Ballintijn
err分享
err收藏
没有更多内容