Audrey Cerqueus

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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 Surro-gate 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(More)
  • 1