320
个编辑
更改
→Network optimization
Network problems that involve finding an optimal way of doing something are studied under the name of [[combinatorial optimization]]. Examples include [[flow network|network flow]], [[shortest path problem]], [[transport problem]], [[transshipment problem]], [[Facility location problem|location problem]], [[Matching (graph theory)|matching problem]], [[assignment problem]], [[packing problem]], [[routing|routing problem]], [[Critical Path Analysis]] and [[PERT]] (Program Evaluation & Review Technique).
Network problems that involve finding an optimal way of doing something are studied under the name of [[combinatorial optimization]]. Examples include [[flow network|network flow]], [[shortest path problem]], [[transport problem]], [[transshipment problem]], [[Facility location problem|location problem]], [[Matching (graph theory)|matching problem]], [[assignment problem]], [[packing problem]], [[routing|routing problem]], [[Critical Path Analysis]] and [[PERT]] (Program Evaluation & Review Technique).
==网络优化==
关于寻找某些事情最优解的网络问题属于[[组合优化]]的范畴。例如[流网络|网络流]]、[[最短路径问题]]、[[运输问题]]、[[转运问题]]、[[设施选址问题|选址问题]]、[[匹配(图论)|匹配问题]]、[[分配问题]]、[[装箱问题]]、[[路由|路由问题]]、[[关键路径分析]]和[[PERT]](规划评估与审查技术)。
==See also==
==See also==