Nicolas Forget

Analysis and discussion of single and multi-objective IP formulations for the Truck-to-dock Door Assignment Problem

  • Xavier Gandibleux
  • Nicolas Forget
    • Categories Applications - OR and Management Sciences, Integer Programming, Multi-Criteria Optimization Tags , , , ,

    \(\) This paper is devoted to the Truck-to-dock Door Assignment Problem. Two integer programming formulations introduced after 2009 are examined. Our review of the literature takes note of the criticisms and limitations addressed to the seminal work of 2009. Although the published adjustments that followed present strong argument and technical background, we have identified several … Read more

    Linear relaxation based branch-and-bound for multi-objective integer programming with warm-starting

  • Nicolas Forget
  • Sune Lauth Gadegaard
  • Lars Relund Nielsen
    • Categories Multi-Criteria Optimization

    In this paper we propose a generic branch-and-bound algorithm for solving multi-objective integer linear programming problems. % In the recent literature, competitive frameworks has been proposed for bi-objective 0-1 problems, and many of these frameworks rely on the use of the linear relaxation to obtain lower bound sets. When increasing the number of objective functions, … Read more

    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