We provide a comprehensive overview of the literature of algorithmic approaches for
multiobjective mixed‐integer and integer linear optimization problems. More precisely, we …

Multi-objective programming is commonly used in the literature when conflicted objectives
arise in solving optimization problems. Over the past decades, classical optimization …

Branch and bound is a well-known generic method for computing an optimal solution of a
single-objective optimization problem. Based on the idea “divide to conquer”, it consists in …

This paper aims at solving three important and challenging issues:(i) How to build a 0-1
mixed integer linear program-based distribution center location model for large-scale …

To sustain the development of maritime transportation,“green ports,” which operate with a
good balance between environmental impact and economic interests, have been the focus …

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 …

The recent success of bi-objective Branch-and-Bound (B&B) algorithms heavily relies on the
efficient computation of upper and lower bound sets. These bound sets are used as a …

Virtual reality (VR) is considered to be one of the main use cases of the fifth-generation
cellular system (5G). In addition, it has been categorized as one of the ultra-low latency …

Many optimization problems encountered in the real-world have more than two objectives.
To address such optimization problems, a number of evolutionary many-objective …

In parallel computing, the scheduling of the tasks of an application onto the processors of the
parallel system is crucial. A task schedule determines both the allocation of tasks to the …