Objective-space decomposition algorithms (ODAs) are widely studied for solving multi-
objective integer programs. However, they often encounter difficulties in handling scalarized …

Most of the literature on reviewer assignment problem (RAP) considers fitness or efficiency
as the evaluation criterion of an assignment, eg, the degree of matching between reviewers …

The nondominated set of a multiple objective discrete optimization problem is known to
contain unsupported nondominated points, which outnumber the supported ones and are …

The increased flexibility provided by the MOO framework also raises the question of what
constitutes a solution to it. The definition of optimality is no longer valid, as each objective …

Combinatorial optimization problems (COPs) are an important branch of mathematical
optimization. It covers practical applications in many fields such as communication …

We propose interactive algorithms to find the most preferred solution of biobjective and
triobjective integer programming problems. The algorithms can be used in any setting where …