Cerqueus, Audrey; Przybylski, Anthony; Gandibleux, Xavier - In: European Journal of Operational Research 244 (2015) 2, pp. 417-433
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 …