.png){kind=icon}
Return
An algorithm for the biobjective integer minimum cost flow problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(99)00095-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, we study the single commodity flow problems, optimizing two objectives simultaneously, where the flow values must be integer values. We propose a method that finds all the efficient integer points in the objective space. Our algorithm performs two phases. In the first phase, all integer points on the efficient boundary are found and in the second phase, the efficient integer points that do not lie on the efficient boundary are calculated. In addition, we carry out a computational experiment showing that the number of efficient integer solutions that do not lie on the efficient boundary is greater than the number of integer solutions on the efficient boundary.
Keywords:
network programming
biobjective integer minimum cost flow problem
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
No organization information available
Cited Papers
ShareSaveAprotinin But Not ε-Aminocaproic Acid Decreases Interleukin-10 After Cardiac Surgery With Extracorporeal Circulation.png)
Circulation
OAAI
CirculationIF0
OAAIShareSaveShareSaveShareSave
View more