Maximum cardinality 1-restricted simple 2-matchings.
Méthode d'aide à la décision sur des évaluations multicritères par plusieurs juges
L'évaluation multicritère est un problème bien connu souvent traité par des méthodes de surclassement. Nous avons ici envisagé le cas général de plusieurs juges et agrégé les différentes évaluations pour construire une matrice de préférences, ramenant ainsi le problème à un problème de comparaisons par paires. Nous avons cherché des solutions optimales de classement en appliquant un algorithme d'affectation quadratique particulier.
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, stochastic approach,...
Minmax regret combinatorial optimization problems: an Algorithmic Perspective
Uncertainty in optimization is not a new ingredient. Diverse models considering uncertainty have been developed over the last 40 years. In our paper we essentially discuss a particular uncertainty model associated with combinatorial optimization problems, developed in the 90's and broadly studied in the past years. This approach named minmax regret (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, stochastic approach,...
Modelli di ottimizzazione combinatoria per problemi di coordinamento nei sistemi di produzione multi-stadio
Moderní pohled na „jistý problém minimální‟