.png){kind=icon}
返回
BICRITERIA NETWORK FLOW PROBLEMS - INTEGER CASE
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)90213-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider a bicriteria network flow problem with flow variables restricted to integer values. The set of efficient solutions to the problem can be obtained by adopting a bicriteria integer programming technique. The purpose of this paper is to present a new technique which capitalizes on the network structure and the unimodular property of the incidence matrix. The procedure uses efficient solutions to the continuous version of the bicriteria network flow problem and parametric programming in order to generate the efficient solutions to the bicriteria integer network flow problem. The performance of the algorithm is also discussed.
Keyword:
NETWORKS
MULTIPLE CRITERIA
OPTIMIZATION
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
没有更多内容
没有更多内容