@article{Maristany de las CasasSede{\~n}o-NodaBornd{\"o}rferetal.2025,
  author    = {Maristany de las Casas, Pedro and Sede{\~n}o-Noda, Antonio and Bornd{\"o}rfer, Ralf and Huneshagen, Max},
  title     = {K-shortest simple paths using biobjective path search},
  journal   = {Mathematical Programming Computation},
  volume    = {17},
  number    = {2},
  publisher = {Springer Science and Business Media LLC},
  issn      = {1867-2949},
  doi       = {10.1007/s12532-025-00276-0},
  pages     = {349 -- 384},
  year      = {2025},
  abstract  = {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 liter- ature. It is based on a black-box algorithm due to Roditty and Zwick [30] that solves at most 2k instances of the Second Shortest Simple Path (2-SSP) problem without specifying how this is done. We fill this gap using a novel approach: we turn the scalar 2-SSP into instances of the Biobjective Shortest Path problem. Our experiments on grid graphs and on road networks show that the new algorithm is very efficient in practice.},
  language  = {en}
}