Multiple objective branch and bound for mixed 0-1 linear programming: Corrections and improvements for the biobjective case

This work addresses the correction and improvement of Mavrotas and Diakoulaki's branch and bound algorithm for mixed 0-1 multiple objective linear programs. We first elaborate the issues encountered by the original algorithm and then propose a corrected version for the biobjective case using an...

Ausführliche Beschreibung