.png){kind=icon}
Return
An exact algorithm for biobjective mixed integer linear programming problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2016.03.001.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, we develop a new criterion space search algorithm to find the Pareto frontier of biobjective mixed-integer linear programming problems. Our algorithm starts with the solution of an individual objective function and then sequentially finds all Pareto line segments and points, which are the elements of the Pareto frontier, of biobjective mixed-integer linear programming problems. At each iteration of the algorithm, one line segment (or one isolated point) of the Pareto frontier is detected. If there is no new Pareto line segment available, the algorithm ends. We provide numerical examples and present performance results of the algorithm over several test problems. (C) 2016 Elsevier Ltd. All rights reserved.
Keywords:
Multi-objective linear programming
Biobjective mixed-integer linear programming
epsilon-constraint methodology
Tabu constraint
Hamming distance
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
ShareSaveAlginate surfactant derivatives as an ecofriendly corrosion inhibitor for carbon steel in acidic environments.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSave
ShareSaveA simple augmented ε-constraint method for multi-objective mathematical integer programming problems
PREAI
ShareSaveShareSave
View more