arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2305.12867math.OC
收藏

确定多目标整数网络流问题所有支撑有效解的输出多项式时间算法

An Output-Polynomial Time Algorithm to Determine all Supported Efficient Solutions for Multi-Objective Integer Network Flow Problems

David Könen, Michael Stiglmayr

AI总结:

本文针对线性多目标整数最小费用流问题(MOIMCF),提出了首个能在输出多项式时间内确定所有支撑有效解的算法,并证明了在目标数d≥3时,除非P=NP,否则不存在确定所有弱支撑非支配向量或有效解的输出多项式时间算法。

摘要:

本文解决了枚举线性多目标整数最小费用流问题(MOIMCF)所有支撑有效解的问题。它推导出一种输出多项式时间算法来确定MOIMCF问题的所有支撑有效解。这是首个在输出多项式时间内解决此一般问题的方法。此外,我们证明,除非P=NP,否则可以排除存在输出多项式时间算法来确定目标数固定为d >= 3的MOIMCF问题的所有弱支撑非支配向量(或所有弱支撑有效解)的可能性。

英文摘要:

This paper addresses the problem of enumerating all supported efficient solutions for a linear multi-objective integer minimum cost flow problem (MOIMCF). It derives an output-polynomial time algorithm to determine all supported efficient solutions for MOIMCF problems. This is the first approach to solve this general problem in output-polynomial time. Moreover, we prove that the existence of an output-polynomial time algorithm to determine all weakly supported nondominated vectors (or all weakly supported efficient solutions) for a MOIMCF problem with a fixed number of d >= 3 objectives can be excluded unless P = NP.

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

↑