Martha Salazar-Neumann

Learn More
We investigate the uncertain versions of two classical combinatorial optimization problems, namely the Single-Pair Shortest Path Problem (SP-SPP) and the Single-Source Shortest Path Problem (SS-SPP). The former consists of finding a path of minimum length connecting two specific nodes in a finite directed graph G; the latter consists of finding the shortest(More)
Coping with uncertainties or ignorance in decision problems may lead to the idea that several scenarios can occur or that several sets of data can constitute a good representation of the reality. In consequence, numerous authors have focused on the robust aspect of these problems. In such a context, one can consider that a scenario (or a particular instance(More)
  • 1