Page 1

Displaying 1 – 4 of 4

Showing per page

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan (2011)

RAIRO - Operations Research

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

Alfredo Candia-Véjar, Eduardo Álvarez-Miranda, Nelson Maculan (2011)

RAIRO - Operations Research

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

Monotone interval eigenproblem in max–min algebra

Martin Gavalec, Ján Plavka (2010)

Kybernetika

The interval eigenproblem in max-min algebra is studied. A classification of interval eigenvectors is introduced and six types of interval eigenvectors are described. Characterization of all six types is given for the case of strictly increasing eigenvectors and Hasse diagram of relations between the types is presented.

Currently displaying 1 – 4 of 4

Page 1