Exact algorithms for multiobjective linear optimization problems with integer variables: A state of the art survey

P Halffmann, LE Schäfer, K Dächert… - Journal of Multi …, 2022 - Wiley Online Library
We provide a comprehensive overview of the literature of algorithmic approaches for
multiobjective mixed‐integer and integer linear optimization problems. More precisely, we …

A criterion space search algorithm for biobjective integer programming: The balanced box method

N Boland, H Charkhgard… - INFORMS Journal on …, 2015 - pubsonline.informs.org
We present a new criterion space search algorithm, the balanced box method, for finding all
nondominated points of a biobjective integer program. The method extends the box …

Solving multiobjective mixed integer convex optimization problems

M De Santis, G Eichfelder, J Niebling… - SIAM Journal on …, 2020 - SIAM
Multiobjective mixed integer convex optimization refers to mathematical programming
problems where more than one convex objective function needs to be optimized …

Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers

D Konur, JF Campbell, SA Monfared - Omega, 2017 - Elsevier
This study analyzes an integrated inventory control and delivery scheduling problem in a
stochastic demand environment with economic and environmental considerations. In …

Bi-objective optimisation over a set of convex sub-problems

G Cabrera-Guerrero, M Ehrgott, AJ Mason… - Annals of Operations …, 2022 - Springer
During the last decades, research in multi-objective optimisation has seen considerable
growth. However, this activity has been focused on linear, non-linear, and combinatorial …

Exact methods for multi-objective combinatorial optimisation

M Ehrgott, X Gandibleux, A Przybylski - … decision analysis: State of the art …, 2016 - Springer
In this chapter we consider multi-objective optimisation problems with a combinatorial
structure. Such problems have a discrete feasible set and can be formulated as integer …

Branch-and-bound for biobjective mixed-integer linear programming

N Adelgren, A Gupte - INFORMS Journal on Computing, 2022 - pubsonline.informs.org
We present a generic branch-and-bound algorithm for finding all the Pareto solutions of a
biobjective mixed-integer linear program. The main contributions are new algorithms for …

An exact algebraic ϵ-constraint method for bi-objective linear integer programming based on test sets

MI Hartillo-Hermoso, H Jiménez-Tafur… - European Journal of …, 2020 - Elsevier
A new exact algorithm for bi-objective linear integer problems is presented, based on the
classic ϵ-constraint method and algebraic test sets for single-objective linear integer …

LEO: Learning Efficient Orderings for Multiobjective Binary Decision Diagrams

R Patel, EB Khalil - International Conference on the Integration of …, 2024 - Springer
Approaches based on Binary decision diagrams (BDDs) have recently achieved state-of-the-
art results for some multiobjective integer programming problems. The variable ordering …

MORBDD: Multiobjective Restricted Binary Decision Diagrams by Learning to Sparsify

R Patel, EB Khalil, D Bergman - arXiv preprint arXiv:2403.02482, 2024 - arxiv.org
In multicriteria decision-making, a user seeks a set of non-dominated solutions to a
(constrained) multiobjective optimization problem, the so-called Pareto frontier. In this work …