arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2101.01103math.OC
收藏

基于表格形式的费用流求和算法求解最小费用流问题

Cost-Flow Summation Algorithm Based on Table Form to Solve Minimum Cost-Flow Problem

Eghbal Hosseini

摘要:

由于最小费用流问题在应用科学和现实生活中的广泛应用,近年来已成为最优化领域的研究热点。因此,寻找这些问题的最优解具有重要意义。虽然已经提出了一些启发式的方法来解决这个问题,但还没有任何方法来总结信息和转换从一个图形形式到一个表格。本文首先将问题的所有信息汇总在一个表格中,然后提出了一个基于费用和流量的有效算法。该算法对大规模问题是强有效的,通过求解我们生成的一些问题,它具有足够合适的结果。

英文摘要:

The minimum cost-flow problems have been attracted recently in optimization because of their applications in several areas of applied science and real life. Therefore, finding optima solution of these problems would be significant. Although some heuristic approaches have been proposed for solving the problem, but there is no any method to summarize information and converting from a graph form to a table. In this paper, at first all information of the problem are summarized in a table and then an efficient algorithm based on considering costs and flows is proposed. The algorithm is strongly efficient for problems with large size and it has sufficiently suitable results by solving some our generated problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑