.png){kind=icon}
Return
Multiple objective minimum cost flow problems: A review
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2005.09.033.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, theory and algorithms for solving the multiple objective minimum cost flow problem are reviewed. For both the continuous and integer case exact and approximation algorithms are presented. In addition, a section on compromise solutions summarizes corresponding results. The reference list consists of all papers known to the authors which deal with the multiple objective minimum cost flow problem. (c) 2005 Elsevier B.V. All rights reserved.
Keywords:
multiple objective programming
network flows
efficient solution
approximation
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveResearch on Global Positioning System in Mobile Communication Equipment Based on Android Platform
OAAI
OAAIShareSave
View more