Pivoting in an Outcome Polyhedron. - Harold P. Benson; Erjiang Sun (J. Glob. Optim., 2000)

A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. - Harold P. Benson; Erjiang Sun (Eur. J. Oper. Res., 2002)

Branch-and-reduce algorithm for convex programs with additional multiplicative constraints. - Harold P. Benson; Erjiang Sun (Eur. J. Oper. Res., 2009)

On Optimization Over the Efficient Set of a Multiple Objective Linear Programming Problem. - Erjiang Sun (J. Optim. Theory Appl., 2017)