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...

Using a sample-based representation scheme to capture spatial and temporal travel time correlations, this article constructs an integer programming model for finding the a priori least expected time paths. We explicitly consider the non-anticipativity constraint associated with the a priori path...

This paper proposes a branch-and-bound algorithm for cyclic scheduling of a robotic flowshop with multiple part types in which the processing times of parts can vary within their given time windows. The problem consists of two types of sequencing issues: part input sequencing and robot move...