1) generalized maximum flow problem
广义最大流问题
1.
This article discusses the inverse generalized upper bounding problem and generalized maximum flow problems.
本文研究了广义上界问题的反问题及广义最大流问题的反问题。
2) Generalized maximal covering location problem
广义最大覆盖选址问题
3) maximum flow problem
最大流问题
1.
A solution to the maximum flow problem of network transmission via MPLS is proposed in this paper.
为解决大多数的流量工程问题和网络传输中的最大流问题 ,该文提出了基于多协议标签交换 (MPLS)解决方案 ;阐述了解决最大流问题的数学方法 ,提出一种独特的将数据流划分成“微分支”的思想和方法 ,并介绍微分支的建立过程 ;给出仿真结
2.
The condition of the maximum flow problem is proposed simply in this article.
简述了网络最大流问题的现状,详细分析了几种具有广泛代表性的网络最大流问题组合算法,同时,阐述了几种在特殊网络结构上的网络最大流问题。
4) maximum-flow problem
最大流问题
1.
, Dinic flow decomposition barrier Algorithms and Goldberg & Rao flow decomposition barrier Algorithms to tackle with the maximum-flow problem of networks were elaborated in details.
简述了网络最大流问题并给出相应的数学模型,在此基础上详细解析了网络最大流问题中的两个典型阻塞流算法:Dinic阻塞流算法、Goldberg和Rao的二分长度阻塞流算法。
2.
The paper explains briefly the present state of the maximum-flow problems of networks and proposes the mathematic models of the web maximum-flow problems simply in this paper and analyses the Goldberg algorithm and key technologies used in it in detail.
简述了网络最大流问题的现状,给出网络最大流问题的数学模型并对Goldberg推进-重标号算法及它所使用的关键技术进行分析,同时阐述了几种在特殊网络结构上的网络最大流问
5) general multicommodity minimal cost flow problem
广义多品种最小费用流问题
1.
Based on the properties of general multicommodity minimal cost flow problems, the problems are first transferred into a bilevel programming problem, which consists of a pair of a lower level programming, called a single-commodity flow problem, and a upper level programming, a separable convex programming.
基于广义多品种最小费用流问题的性质,将问题转化成一对含有内、外层问题的双水平规划。
补充资料：广义
范围较宽的定义（跟‘狭义’相对）：～的杂文也可以包括小品文在内。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条