On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs

Autor: Assunção, Lucas, Santos, Andréa Cynthia, Noronha, Thiago F., Andrade, Rafael

Publikováno v: Proceedings of the International Symposium on Combinatorial Optimization (ISCO) 2016: Lecture Notes in Computer Science, vol 9849. Combinatorial Optimization pp 1-12. Springer, Cham

This paper addresses a class of problems under interval data uncertainty composed of min-max regret versions of classical 0-1 optimization problems with interval costs. We refer to them as interval 0-1 min-max regret problems. The state-of-the-art ex

Externí odkaz: http://arxiv.org/abs/2001.00943

Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters

Autor: de Castro Pena, Guilherme, Santos, Andréa Cynthia, Prins, Christian

Publikováno v: In European Journal of Operational Research 1 April 2023 306(1):156-172

Solving the probabilistic drone routing problem: Searching for victims in the aftermath of disasters.

Autor: Almeida Coco, Amadeu, Duhamel, Christophe, Santos, Andréa Cynthia, Haddad, Matheus Nohra

Publikováno v: Networks; Jul2024, Vol. 84 Issue 1, p31-50, 20p

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs

Autor: Assunção, Lucas, Noronha, Thiago F., Santos, Andréa Cynthia, Andrade, Rafael

Publikováno v: In Computers and Operations Research May 2017 81:51-66