The Routing Problem with “K” Specified Nodes
Published Online:1 Oct 1966https://doi.org/10.1287/opre.14.5.909
- Cited by
- 15 December 2024 | Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Vol. 64, No. 6
- 18 July 2024 | Computational Mathematics and Mathematical Physics, Vol. 64, No. 6
- 18 June 2024 | AppliedMath, Vol. 4, No. 2
- 1 October 2023 | International Journal of Mathematical, Engineering and Management Sciences, Vol. 8, No. 5
- 6 October 2022 | Journal of Scheduling, Vol. 26, No. 3
- 24 May 2023 | Applied Sciences, Vol. 13, No. 11
- IFAC-PapersOnLine, Vol. 55, No. 10
- 28 March 2018 | The European Physical Journal Plus, Vol. 133, No. 3
- 30 September 2017 | Networks, Vol. 70, No. 4
- Optical Switching and Networking, Vol. 23
- European Journal of Operational Research, Vol. 254, No. 3
- 4 October 2012 | OPSEARCH, Vol. 50, No. 2
- European Journal of Operational Research, Vol. 73, No. 1
- 11 October 2006 | Networks, Vol. 19, No. 4
- 29 March 2011 | RAIRO - Operations Research, Vol. 18, No. 3
- 11 October 2006 | Networks, Vol. 4, No. 3
- Unternehmensforschung Operations Research - Recherche Opérationnelle, Vol. 15, No. 1
- Trabajos de estadistica y de investigacion operativa, Vol. 21, No. 3
Volume 14, Issue 5
September-October 1966
Pages 759-975
Article Information
Metrics
Information
- Published Online:October 01, 1966
© 1966 INFORMS
Cite as
J. P. Saksena, Santosh Kumar, (1966) The Routing Problem with “K” Specified Nodes. Operations Research 14(5):909-913.
https://doi.org/10.1287/opre.14.5.909
