.png){kind=icon}
.png){kind=icon}
Return
K-PPM: A new exact method to solve multi-objective combinatorial optimization problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2008.12.034.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
in this paper we propose an exact method able to solve multi-objective combinatorial optimization problems. This method is an extension, for any number of objectives, of the 2-Parallel Partitioning Method (2-PPM) we previously proposed. Like 2-PPM, this method is based on splitting of the search space into several areas, leading to elementary searches. The efficiency of the proposed method is evaluated using a multi-objective flow-shop problem. (C) 2009 Elsevier B.V. All rights reserved.
Keywords:
Exact method
Multi-objective problem
Combinatorial optimization
Flow-shop problem
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