An exact parallel objective space decomposition algorithm for solving multi-objective integer programming problems

Lipschitzian optimization without the Lipschitz constant

Donald R. Jones, C.D. Perttunen, B.E. Stuckman · Journal of Optimization Theory and Applications · 1993 · 2K citations

Natural Sciences, Mathematics, Optimization +11

A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems

Gökhan Kirlik, Serpil Sayın · European Journal of Operational Research · 2013 · 159 citations

Natural Sciences, Computer Science, Mathematics +9

A branch and bound algorithm for mixed zero-one multiple objective linear programming

G. Mavrotas, D. Diakoulaki · European Journal of Operational Research · 1998 · 138 citations · Full text

Business, Computer Science, Algorithms +8

Bound sets for biobjective combinatorial optimization problems

Matthias Ehrgott, Xavier Gandibleux · Computers & Operations Research · 2006 · 122 citations

Natural Sciences, Computer Science, Mathematics +12

A method for finding the set of non-dominated vectors for multiple objective integer linear programs

John Sylva, Alejandro Crema · European Journal of Operational Research · 2003 · 121 citations

Business, Computer Science, Algorithms +12