Meriem Ait Mehdi

Learn More
While most of the published exact methods for solving multi-objective integer linear programming (MOILP) problems are based on solving many integer linear programs (ILP), we propose a branch and bound multi-objective method to find the whole non-dominated set. Two types of nodes are created in the tree. The first type corresponds to not integer optimal(More)
  • 1