.png){kind=icon}
Return
A two-phase algorithm for the biobjective integer minimum cost flow problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2008.06.008.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We present an algorithm to compute a complete set of efficient solutions for the biobjective integer minimum cost flow problem. We use the two phase method, with a parametric network simplex algorithm in phase I to compute all non-dominated extreme points. In phase 2, the remaining non-dominated points (non-extreme supported and non-supported) are computed using a k best flow algorithm on single-objective weighted sum problems. We implement the algorithm and report run-times on problem instances generated with a modified version of the NETGEN generator and also for networks with a grid structure. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Biobjective integer minimum cost flow problem
Two phase method
k best flow algorithm
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
ShareSaveAprotinin But Not ε-Aminocaproic Acid Decreases Interleukin-10 After Cardiac Surgery With Extracorporeal Circulation.png)
Circulation
OAAI
CirculationIF0
OAAIShareSaveShareSaveShareSave
View more