全局最优匹配法是把匹配问题转化为运筹学中网络流(network flows) 问题, 把处理组和对照组的研究对象看作节点(node) , 把匹配转化为求节点间的总距离的最小化问题, 不保证处理组的每个研究对...
基于52个网页-相关网页
Network Flows and General Matchings 网络流和一般匹配
Linear programming and network flows 线性编程与网络流
Graph Theory and Network Flows 图论与网络流
Network Flows Matrix 网络流矩阵
network flows models 网络流模型
transportation network flows 交通网络流
inherent features of network flows 网络流的内在特征
The book can also be utilized in a one-semester course on linear programming and network flows.
本书也可作为一学期课程:线性规划和网络流。
The book can also be used as a text for a course on either linear programming or network flows.
本书也可当成线性规划或网络流课程的教材。
Manufacturing network flows is a generalized network model, a rebuilt new model complicated manufacturing scenarios.
生产网络流是一种广义的网络流模型,是基于复杂的生产过程,重新建立的一种新模型。
应用推荐