RS Burachik, CY Kaya, MM Rizvi - Engineering Optimization, 2022 - Taylor & Francis
Multi-objective integer or mixed-integer programming problems typically have disconnected feasible domains, making the task of constructing an approximation of the Pareto front …
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 …
W Zhang, M Reimann - European Journal of Operational Research, 2014 - Elsevier
A simple augmented∊-constraint (SAUGMECON) method is put forward to generate all non- dominated solutions of multi-objective integer programming (MOIP) problems. The …
Dealing with multi-objective problems by using generation methods has some interesting advantages since it provides the decision-maker with the complete information about the set …
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 …
Multi-objective optimization procedures usually proceed by iteratively producing new solutions. For this purpose, a key issue is to determine and efficiently update the search …
We present a new variant of the full 2-split algorithm, the Quadrant Shrinking Method (QSM), for finding all nondominated points of a tri-objective integer program. The algorithm is easy …
We present a new algorithm for optimizing a linear function over the set of efficient solutions of a multiobjective integer program (MOIP). The algorithm's success relies on the efficiency …