.png){kind=icon}
Return
BICRITERIA NETWORK FLOW PROBLEMS - INTEGER CASE
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)90213-7.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
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.
Keywords:
NETWORKS
MULTIPLE CRITERIA
OPTIMIZATION
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}
ShareSaveShareSave
no more
no more