.png){kind=icon}
Return
A branch and bound algorithm for mixed zero-one multiple objective Linear programming
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00077-5.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this paper, a branch and bound algorithm for the generation of the efficient set in mixed zero-one multiple objective linear programming problems is presented. The algorithm is developed as to take account of the multiple objectives in the node fathoming procedure. In order to extend the algorithm's applicability to large sized problems from real life, an interactive procedure is introduced which systematically reduces the number of efficient points and thus saves considerable computational effort without losing essential information. The algorithm is tested in randomly generated problems along with a case study concerning the power generation sector. (C) 1998 Elsevier Science B.V.
Keywords:
multiple criteria programming
integer programming
branch and bound
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}
ShareSaveShareSaveShareSaveShareSave
View more