The Routing Problem with "K" Specified Nodes

@article{Saksena1966TheRP,
  title={The Routing Problem with "K" Specified Nodes},
  author={J. P. Saksena and Santosh Kumar},
  journal={Operations Research},
  year={1966},
  volume={14},
  pages={909-913}
}

Topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 13 CITATIONS

A Multi-Stage Metaheuristic Algorithm for Shortest Simple Path Problem With Must-Pass Nodes

  • IEEE Access
  • 2019
VIEW 4 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Bio-Inspired Computing - Theories and Applications

  • Communications in Computer and Information Science
  • 2014
VIEW 10 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Protected shortest path visiting specified nodes

  • 2015 7th International Workshop on Reliable Networks Design and Modeling (RNDM)
  • 2015
VIEW 3 EXCERPTS
CITES METHODS
HIGHLY INFLUENCED

LARAC-SN and Mole in the Hole: Enabling Routing through Service Function Chains

  • 2018 4th IEEE Conference on Network Softwarization and Workshops (NetSoft)
  • 2018
VIEW 3 EXCERPTS
CITES BACKGROUND

An efficient heuristic for calculating a protected path with specified nodes

  • 2016 8th International Workshop on Resilient Networks Design and Modeling (RNDM)
  • 2016
VIEW 2 EXCERPTS
CITES METHODS

Similar Papers

Loading similar papers…