Florian Seipp

Learn More
This work addresses the correction and improvement of Mavro-tas and Diakoulaki's branch and bound algorithm for mixed 0-1 MOLP. We first develop about the issues encountered by the original algorithm and propose and corrected version for the biobjective case. We then introduce several improvements about the bounds and end with the proposition of a new(More)
  • 1