arrow
Return

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
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

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.
Keywords:
Combinatorial optimization
Multiple objective programming
Bi-dimensional binary knapsack problem
Surrogate relaxation
Bound sets
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

European Journal of Operational Research cover
European Journal of Operational Research
IF:
6
Papers:
2.2W
Citations:
6.4W

Organization

N
nantes universite
Scholars:
1.7W
Papers: 1.2W
Citations: 125
Cited Papers

Cited Papers

The off-line group seat reservation problem
err2010-12-01
err6
PREAI
errClausen, Tommy; Hjorth, Allan Nordlunde; Nielsen, Morten; Pisinger, David
errShare
errSave
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
errShare
errSave
errShare
errSave
errShare
errSave
researcher View more