2 papers
math.OC2022
Benders Decomposition for Bi-objective Linear Programs
Andrea Raith, Richard Lusby, Ali Akbar Sohrabi Yousefkhan
In this paper, we develop a new decomposition technique for solving bi-objective linear programming problems. The proposed methodology combines the bi-objective simplex algorithm w…
math.OC2017
Multi-objective minmax robust combinatorial optimization with cardinality-constrained uncertainty
Andrea Raith, Marie Schmidt, Anita Schöbel +1
In this paper we develop two approaches to find minmax robust efficient solutions for multi-objective combinatorial optimization problems with cardinality-constrained uncertainty.…