.png){kind=icon}
Return
Parallel optimization over the integer efficient set
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.13202.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper introduces a modified sequential version method for optimizing a linear function over an integer efficient set, as well as a new exact parallel algorithm. The performance of parallel programming in this context is clear and shown through different instances with different sizes. Each procedure builds a finite monotonous sequence of values for the main criterion to be optimized, in a reasonable amount of CPU execution time. This latter remains much better. For the first time, the Algerian IBNBADIS cluster-CERIST-was used with this type of problem. Significant results are obtained by both proposed techniques, particularly with the parallel one.
Keywords:
optimization
integer linear programming
multiple objective
parallel computing
OpenMP
parallelization
Journal
IF:
2.9
Papers:
1.8K
Citations:
3.7K
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveA method for finding the set of non-dominated vectors for multiple objective integer linear programs
PREAI
ShareSave
View more