The optimization of the product portfolio problem under return uncertainty is addressed here.
The contribution of this study is based on the application of a hybrid improved artificial …

This work studies an assembly line balancing problem with uncertainty on the task times. In
order to deal with the uncertainty, a robust formulation to handle changes in the operation …

In this survey, we discuss the state of the art of robust combinatorial optimization under
uncertain cost functions. We summarize complexity results presented in the literature for …

We study the vehicle routing problem with time windows under demand uncertainty. Such a
problem arises in fuel delivery to gas stations, to farms, or to production plants. We suggest a …

We consider an uncertain variant of the knapsack problem in which the weight of the items is
not exactly known in advance, but belongs to a given interval, and an upper bound is …

We present in this paper a new model for robust combinatorial optimization with cost
uncertainty that generalizes the classical budgeted uncertainty set. We suppose here that …

We study in this paper min max robust combinatorial optimization problems for an
uncertainty polytope that is defined by knapsack constraints, either in the space of the …

Autonomous buses offer a promising solution to the first-and last-mile problems, but their
initial deployment requires safety drivers to supervise bus operations. Compared to …

Purpose The principal concern of organization managers in the global rivalry of commerce
environment is how to select the project portfolio among available projects. In this matter …

We study the robust constrained shortest path problem under resource uncertainty. After
proving that the problem is in the strong sense for arbitrary uncertainty sets, we focus on …