Current generalizations of the central ideas of single-objective branch-and-bound to the multiobjective setting do not seem to follow their train of thought all the way. The present paper complements the various suggestions for generalizations of partial lower bounds and of overall upper bounds...

In this work we study binary two-stage robust optimization problems with objective uncertainty. We present an algorithm to calculate efficiently lower bounds for the binary two-stage robust problem by solving alternately the underlying deterministic problem and an adversarial problem. For the...

Our research is aimed at finding the optimization of the service provided to citizens, in order to avoid breakdowns in certain administrative services compared to other services that have low levels of activity. The algorithm applied (Branch & Bound) detects what branches of the tree...

Our research is aimed at finding the optimization of the service provided to citizens, in order to avoid breakdowns in certain administrative services compared to other services that have low levels of activity. The algorithm applied (Branch & Bound) detects what branches of the tree...

We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially reiiewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make...

We consider a generalization of the classical resource constrained project scheduling problem. We introduce so-called partially reiiewable resources by assuming for each resource a capacity on subsets of periods. The concept of partially renewable resources is a fundamental tool in order to make...