.png){kind=icon}
返回
The biobjective minimum cost flow problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00191-5.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we study the single commodity flow problem, optimizing two objectives simultaneously. We propose a method that finds all the efficient extreme points in the objective space. This method is based on the well known method of Lee and Pulat, which also computes some efficient points of the objective space that are not extreme points. Our alternative method corrects this particularity by using the idea of adjacency among efficient extreme points in the objective space and introduces computational improvements that are shown in an experimental study. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
network programming
biobjective minimum cost flow problem
efficient extreme points
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
A General Approach to the Non-Invasive Imaging of Transgenes Using Cis-Linked Herpes Simplex Virus Thymidine Kinase.png)
Neoplasia
OAAI
NeoplasiaIF0
OAAI分享收藏Investigation of the association of serum trace elements concentrations and serum biochemical parameters with the risk of polycystic ovary syndrome: a case-control study血清微量元素浓度与血清生化参数与多囊卵巢综合征风险关联性的研究：一项病例对照研究
IF0
PREAI
分享收藏Aprotinin But Not ε-Aminocaproic Acid Decreases Interleukin-10 After Cardiac Surgery With Extracorporeal CirculationCirculation
OAAI
CirculationIF0
OAAI分享收藏
查看更多内容