一种新的等流问题求解方法
Novel Approach for Solving a Variant of Equal Flow Problem
摘要：
在这篇文章中，我们考虑了一个已知的NP困难的子类的等流问题[8]。目前还没有直接的解决方案。这是各种库存管理系统中常见的问题。这里我们讨论了一个局部极小解，它利用凸空间的投影来求解相等流，并将问题转化为一个已知的线性整数规划或约束满足问题，这些问题具有合理的已知解，并且可以使用单纯形或其他标准优化策略有效地求解。
英文摘要：
In this article we consider a certain sub class of Integer Equal Flow problem, which are known NP hard [8]. Currently there exist no direct solutions for the same. It is a common problem in various inventory management systems. Here we discuss a local minima solution which uses projection of the convex spaces to resolve the equal flows and turn the problem into a known linear integer programming or constraint satisfaction problem which have reasonable known solutions and can be effectively solved using simplex or other standard optimization strategies.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
