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)
A class representative model for pure parsimony haplotyping / INFORMS Journal on Computing, to appear. Mathematical models for HLA association studies: A case study for psoriasis and severe alopecia areata / Tissue Antigens 73(5), 399-400, 2009. models to reconstruct phylogenetic trees under the minimum evolution criterion
  • 1