Add to ORKGIn combinatorial optimization, and partic-ularly in location problems, the most used robustnesscriteria rely either on maximal cost or on maximal regret.However, it is well known that these criteria are tooconservative. In this paper, we present a new robustnessapproach, called lexicographic α-robustness, which com-pensates for the drawbacks of the criteria based on theworst case. We apply this notion to the 1-median locationproblem under uncertainty and we give a polynomialalgorithm to determine robust solutions in the case of atree graph.ouinonouirechercheInternationa
This paper is devoted to the the search of robust solutions in state space graphs when costs depend ...
In robust combinatorial optimization with discrete uncertainty, approximation algorithms based on co...
The knapsack problem is a classical combinatorial optimization problem used to model many industrial...
In the last decade, several robustness approaches have been developed to deal with uncertainty. In d...
International audienceIn the last decade, several robustness approaches have been developed to deal ...
International audienceIn the last decade, several robustness approaches have been developed to deal ...
We extend the standard concept of robust optimization by the introduction of an alternative solution...
In this thesis, we study robust combinatorial problems with interval data. We introduce several new ...
International audienceThis paper is devoted to the search of robust solutions in finite graphs when ...
In this thesis, we study robust combinatorial problems with interval data. We introduce several new ...
We consider a family of 1-median location problems on a tree network where the vertex weights are ra...
This paper studies an extension of the k-median prob-lem where we are given a metric space (V, d) an...
Many combinatorial optimization problems arising in real-world applications do not have accurate est...
International audienceThe knapsack problem is a classical combinatorial optimization problem used to...
In classic robust optimization, it is assumed that a set of possible parameter realizations, the unc...
This paper is devoted to the the search of robust solutions in state space graphs when costs depend ...
In robust combinatorial optimization with discrete uncertainty, approximation algorithms based on co...
The knapsack problem is a classical combinatorial optimization problem used to model many industrial...
In the last decade, several robustness approaches have been developed to deal with uncertainty. In d...
International audienceIn the last decade, several robustness approaches have been developed to deal ...
International audienceIn the last decade, several robustness approaches have been developed to deal ...
We extend the standard concept of robust optimization by the introduction of an alternative solution...
In this thesis, we study robust combinatorial problems with interval data. We introduce several new ...
International audienceThis paper is devoted to the search of robust solutions in finite graphs when ...
In this thesis, we study robust combinatorial problems with interval data. We introduce several new ...
We consider a family of 1-median location problems on a tree network where the vertex weights are ra...
This paper studies an extension of the k-median prob-lem where we are given a metric space (V, d) an...
Many combinatorial optimization problems arising in real-world applications do not have accurate est...
International audienceThe knapsack problem is a classical combinatorial optimization problem used to...
In classic robust optimization, it is assumed that a set of possible parameter realizations, the unc...
This paper is devoted to the the search of robust solutions in state space graphs when costs depend ...
In robust combinatorial optimization with discrete uncertainty, approximation algorithms based on co...
The knapsack problem is a classical combinatorial optimization problem used to model many industrial...