Anthony Przybylski

Branch-and-bound and objective branching with three objectives

  • Nicolas Forget
  • Sune Lauth Gadegaard
  • Kathrin Klamroth
  • Lars Relund Nielsen
  • Anthony Przybylski
    • Categories Multi-Criteria Optimization

    The recent success of bi-objective Branch-and-Bound (B&B) algorithms heavily relies on the efficient computation of upper and lower bound sets. Besides the classical dominance test, bound sets are used to improve the computational time by imposing inequalities derived from (partial) dominance in the objective space. This process is called objective branching since it is mostly … Read more

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

  • Audrey Cerqueus
  • Xavier Gandibleux
  • Anthony Przybylski
    • Categories Combinatorial Optimization, Multi-Criteria Optimization Tags , , , ,

    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 … Read more