The Satisfactory Partition problem asks for deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighbors in its part as in the other part. This problem was introduced by Gerber and Kobler [M. Gerber, D. Kobler,...

In the present work, we are interested in the practical behavior of a new fully polynomial time approximation schemes (fptas) to solve the approximation version of the 0-1 multi-objective knapsack problem. The proposed methodology makes use of very general techniques (such as dominance relations...

Min-max and min-max regret criteria are commonly used to define robust solutions. After motivating the use of these criteria, we present general results. Then, we survey complexity results for the min-max and min-max regret versions of some combinatorial optimization problems: shortest path,...

We consider a variant of the generalized assignment problem (GAP) where the amount of space used in each bin is restricted to be either zero (if the bin is not opened) or above a given lower bound (a minimum quantity). We provide several complexity results for different versions of the problem...

In this paper, we consider the problem of adaptive traffic control on single junctions with the three following objectives to be minimized: the total waiting time and the number of stops for private vehicles, and a public transport criterion. This problem being modeled as a multi-objective mixed...

Robustness in Operations Research/Decision Aid is often associated with min–max and min–max regret criteria. This common approach to determine robust solutions consists in finding a solution which minimizes the maximal cost or regret. Nevertheless, these criteria are known to be too...