arrow
返回

Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems

delete2015-07-01
delete10
PRE
AI
A
Audrey Cerqueus *
A
Anthony Przybylski
X
Xavier Gandibleux
DOI:10.1016/j.ejor.2015.01.035delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
The paper deals with the definition and the computation of surrogate upper bound sets for the bi-objective bi-dimensional binary knapsack problem. It introduces the Optimal Convex Surrogate Upper Bound set, which is the tightest possible definition based on the convex relaxation of the surrogate relaxation. Two exact algorithms are proposed: an enumerative algorithm and its improved version. This second algorithm results from an accurate analysis of the surrogate multipliers and the dominance relations between bound sets. Based on the improved exact algorithm, an approximated version is derived. The proposed algorithms are benchmarked using a dataset composed of three groups of numerical instances. The performances are assessed thanks to a comparative analysis where exact algorithms are compared between them, the approximated algorithm is confronted to an algorithm introduced in a recent research work. (C) 2015 Elsevier B.V. All rights reserved.
Keyword:
Combinatorial optimization
Multiple objective programming
Bi-dimensional binary knapsack problem
Surrogate relaxation
Bound sets
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

European Journal of Operational Research 封面图
European Journal of Operational Research
IF:
6
论文数:
2.2W
被引数:
6.4W

机构

N
nantes universite
学者数:
1.7W
论文数: 1.2W
被引数: 125
引用论文

引用论文

The off-line group seat reservation problem
err2010-12-01
err6
PREAI
errClausen, Tommy; Hjorth, Allan Nordlunde; Nielsen, Morten; Pisinger, David
err分享
err收藏
err分享
err收藏
STUDY OF ACTIVE FARMLAND USE TO SUPPORT AGENT-BASED MODELING OF FOOD DESERTS
err2020-11-17
err0
errOAAI
errS. S. Dhamankar; L. Hashemi-Beni; L. A. Kurkalova; C. L. Liang; T. Mulrooney; M. Jha; G. Monty; H. Miao
err分享
err收藏
err分享
err收藏
学者 查看更多内容