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

Bitran, 1977, Linear multiple objective programs with zero-one variables, Mathematical Programming, 13, 121, 10.1007/BF01584332 Bitran, 1979, Theory and algorithms for linear multiple objective programs with zero-one variables, Mathematical Programming, 17, 362, 10.1007/BF01588256 Clímaco, 1997, Multicriteria integer programming, 248 Deckro, 1983, Solving zero-one multiple objective programs through implicit enumeration, European Journal of Operational Research, 12, 362, 10.1016/0377-2217(83)90157-1 Ehrgott, 2005 Ehrgott, 2007, Bound sets for biobjective combinatorial optimization problems, Computers & Operations Research, 34, 2674, 10.1016/j.cor.2005.10.003 Gandibleux X, Morita H, Katoh H. Evolutionary operators based on elite solutions for bi-objective combinatorial optimization. In: Coello C, Lamont G, editors. Applications of multi-objective evolutionary algorithms. Advances in natural computation, vol. 1; 2004. p. 555–79 [Chapter 23]. Geoffrion, 1968, Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications, 22, 618, 10.1016/0022-247X(68)90201-1 Isermann, 1977, The enumeration of the set of all efficient solutions for a linear multiple objective program, Operational Research Quarterly, 28, 711, 10.1057/jors.1977.147 Laumanns, 2006, An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method, European Journal of Operational Research, 169, 932, 10.1016/j.ejor.2004.08.029 Mavrotas, 1998, A branch and bound algorithm for mixed zero-one multiple objective linear programming, European Journal of Operational Research, 107, 530, 10.1016/S0377-2217(97)00077-5 Mavrotas, 2005, Multi-criteria branch and bound, Applied Mathematics and Computation, 171, 53, 10.1016/j.amc.2005.01.038 Özlen, 2009, Multi-objective integer programming, European Journal of Operational Research, 199, 25, 10.1016/j.ejor.2008.10.023 Ralphs, 2006, An improved algorithm for solving biobjective integer programs, Annals of Operations Research, 147, 43, 10.1007/s10479-006-0058-z Rasmussen, 1986, Zero-one programming with multiple criteria, European Journal of Operational Research, 26, 83, 10.1016/0377-2217(86)90161-X Steuer, 1986 Sylva, 2004, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, European Journal of Operational Research, 158, 46, 10.1016/S0377-2217(03)00255-8 Villarreal, 1981, Multicriteria integer programming, Mathematical Programming, 21, 204, 10.1007/BF01584241