Antonio Sedeño-Noda

K-Shortest Simple Paths Using Biobjective Path Search

  • Pedro Maristany de las Casas
  • Antonio Sedeño-Noda
  • Ralf Borndœrfer
    • Categories Dynamic Programming, Multi-Criteria Optimization, Network Optimization Tags , , ,

    In this paper we introduce a new algorithm for the k-Shortest Simple Paths (k-SSP) problem with an asymptotic running time matching the state of the art from the literature. It is based on a black-box algorithm due to Roddity and Zwick that solves at most 2k instances of the Second Shortest Simple Path (2-SSP) problem … Read more

    Targeted Multiobjective Dijkstra Algorithm

  • Pedro Maristany de las Casas
  • Luitgard Kraus
  • Antonio Sedeño-Noda
  • Ralf Borndœrfer
    • Categories Multi-Criteria Optimization, Network Optimization Tags , , , , ,

    In this paper, we introduce the Targeted Multiobjective Dijkstra Algorithm (T-MDA), a label setting algorithm for the One-to-One Multiobjective Shortest Path (MOSP) Problem. The T-MDA is based on the recently published Multiobjective Dijkstra Algorithm (MDA) and equips it with A*-like techniques. The resulting speedup is comparable to the speedup that the original A* algorithm achieves … Read more

    An O(nm) time algorithm for finding the min length directed cycle in a graph

  • James B. Orlin
  • Antonio Sedeño-Noda
    • Categories Graphs and Matroids, Network Optimization, Optimization Software and Modeling Systems Tags , ,

    In this paper, we introduce an $O(nm)$ time algorithm to determine the minimum length directed cycle in a directed network with $n$ nodes and $m$ arcs and with no negative length directed cycles. This result improves upon the previous best time bound of $O(nm + n^2 \log\log n)$. Our algorithm first determines the cycle with … Read more