更改

There is a large amount of literature on polynomial-time algorithms for certain special classes of discrete optimization, a considerable amount of it unified by the theory of linear programming. Some examples of combinatorial optimization problems that fall into this framework are shortest paths and shortest-path trees, flows and circulations, spanning trees, matching, and matroid problems.

There is a large amount of literature on polynomial-time algorithms for certain special classes of discrete optimization, a considerable amount of it unified by the theory of linear programming. Some examples of combinatorial optimization problems that fall into this framework are shortest paths and shortest-path trees, flows and circulations, spanning trees, matching, and matroid problems.

对于某些特殊的离散优化问题，有大量的文献是关于'''<font color="#FF8000">多项式时间 Polynomial Algorithm <\font>'''算法的，其中相当一部分是由'''<font color="#FF8000">线性规划 Linear Programming <\font>'''理论统一起来的。属于这个框架的组合优化问题的一些例子包括'''<font color="#FF8000">最短路径 Shortest paths <\font>'''和'''<font color="#FF8000">最短路径树 Shortest-path Tree <\font>'''、'''<font color="#FF8000">流和循环 Flows And Circulations <\font>'''、生成树、'''<font color="#FF8000">匹配和拟阵 Matching And Matroid Problems <\font>'''问题。

对于某些特殊的离散优化问题，有大量的文献是关于'''<font color="#FF8000">多项式时间 Polynomial Algorithm </font>'''算法的，其中相当一部分是由'''<font color="#FF8000">线性规划 Linear Programming </font>'''理论统一起来的。属于这个框架的组合优化问题的一些例子包括'''<font color="#FF8000">最短路径 Shortest paths </font>'''和'''<font color="#FF8000">最短路径树 Shortest-path Tree </font>'''、'''<font color="#FF8000">流和循环 Flows And Circulations </font>'''、生成树、'''<font color="#FF8000">匹配和拟阵 Matching And Matroid Problems </font>'''问题。