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 …

[HTML][HTML] Integrating sustainability into pavement maintenance effectiveness evaluation: A systematic review

Z Liu, R Balieu, N Kringos - Transportation Research Part D: Transport and …, 2022 - Elsevier
Based on the publications from two databases during 1998–2020, this paper presents a
systematic literature review on pavement maintenance effectiveness evaluation to …

A global-responsive supply chain considering sustainability and resiliency: application in the medical devices industry

S Nayeri, Z Sazvar, J Heydari - Socio-Economic Planning Sciences, 2022 - Elsevier
Given the requirements of international businesses, this research addresses the supply
chain network design problem in the real-world situation by considering four critical features …

A multi-objective optimization-based pavement management decision-support system for enhancing pavement sustainability

J Santos, A Ferreira, G Flintsch - Journal of Cleaner Production, 2017 - Elsevier
Current practice adopted by highway agencies with regards to pavement management, has
mostly consisted of employing life cycle costs analysis (LCCA) systems to evaluate the …

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 …

Branch regulation: Low-overhead protection from code reuse attacks

M Kayaalp, M Ozsoy, N Abu-Ghazaleh… - ACM SIGARCH …, 2012 - dl.acm.org
Code reuse attacks (CRAs) are recent security exploits that allow attackers to execute
arbitrary code on a compromised machine. CRAs, exemplified by return-oriented and jump …

A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems

K Dächert, K Klamroth - Journal of Global Optimization, 2015 - Springer
Multi-objective optimization problems are often solved by a sequence of parametric single-
objective problems, so-called scalarizations. If the set of nondominated points is finite, the …

Generation of the exact pareto set in multi-objective traveling salesman and set covering problems

K Florios, G Mavrotas - Applied Mathematics and Computation, 2014 - Elsevier
The calculation of the exact set in Multi-Objective Combinatorial Optimization (MOCO)
problems is one of the most computationally demanding tasks as most of the problems are …

Branch-and-bound for bi-objective integer programming

SN Parragh, F Tricoire - INFORMS Journal on Computing, 2019 - pubsonline.informs.org
In bi-objective integer optimization the optimal result corresponds to a set of nondominated
solutions. We propose a generic bi-objective branch-and-bound algorithm that uses a …

Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations

T Holzmann, JC Smith - European Journal of Operational Research, 2018 - Elsevier
In this paper we present the modified augmented weighted Tchebychev norm, which can be
used to generate a complete efficient set of solutions to a discrete multi-objective …