Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-VéjarEduardo Álvarez-MirandaNelson 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 (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, , where uncertainty is modeled by...

Minmax regret combinatorial optimization problems: an Algorithmic Perspective

Alfredo Candia-VéjarEduardo Álvarez-MirandaNelson 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 (in particular our emphasis is on the robust deviation criteria) is different from the classical approach for handling uncertainty, , where uncertainty is modeled by...

Page 1

Download Results (CSV)