Multi-objective integer or mixed-integer programming problems typically have disconnected
feasible domains, making the task of constructing an approximation of the Pareto front …

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

We study the following multi-period multi-objective online ride-matching problem. A ride-
sourcing platform needs to match passengers and drivers in real time without observing …

Multiobjective mixed integer convex optimization refers to mathematical programming
problems where more than one convex objective function needs to be optimized …

In this paper, we propose a generic algorithm to compute exactly the set of nondominated
points for multiobjective discrete optimization problems. Our algorithm extends the ε …

This paper deals with a complex multi-objective personnel scheduling problem motivated by
a real case. A multi-objective mixed integer linear programming formulation of the problem is …

Failures within water distribution systems are usually not isolated and tend to propagate to
corresponding transportation infrastructure, yet most criticality and resilience analyses of …

We present a linear programming based branch-and-bound algorithm for a class of mixed
integer optimization problems with a bi-linear objective function and linear constraints. This …

This study introduces an algorithm based on the branch‐and‐bound approach for optimizing
a main function Ψ Ψ over the nondominated set of a multiobjective integer programming …

This paper addresses a linear programming problem with interval right-hand sides, forming
a family of linear programs associated with each realization of the interval data. The paper …