.png){kind=icon}
返回
An exact algorithm for biobjective integer programming problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2021.105298.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose an exact algorithm for solving biobjective integer programming problems, which arise in various applications of operations research. The algorithm is based on solving Pascoletti-Serafini scalarizations to search specified regions (boxes) in the objective space and returns the set of nondominated points. We implement the algorithm with different strategies, where the choices of the scalarization model parameters and splitting rule differ. We then derive bounds on the number of scalarization models solved; and demonstrate the performances of the variants through computational experiments both as exact algorithms and as solution approaches under time restriction. The experiments demonstrate that different strategies have advantages in different aspects: while some are quicker in finding the whole set of nondominated solutions, others return good-quality solutions in terms of representativeness when run under time restriction. We also compare the proposed approach with existing algorithms. The results of our experiments show the satisfactory behaviour of our algorithm, especially when run under time limit, as it achieves better coverage of the whole frontier with a smaller number of solutions compared to the existing algorithms.
Keyword:
Biobjective integer programming
Pascoletti-Serafini scalarization
Algorithms
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
分享收藏A Systematic Review of Clinical Diagnostic Systems Used in the Diagnosis of Tuberculosis in ChildrenOAAI
OAAI分享收藏Conformational change and protein–protein interactions of the fusion protein of Semliki Forest virusSemliki森林病毒融合蛋白的构象变化和蛋白-蛋白相互作用.png)
Nature
NatureIF0
PREAI
分享收藏
查看更多内容