An-Najah National University

Amjed Mahmoud Muhammad Al-Ghanim


  • Bookmark and Share Email
  • Tuesday, October 1, 1996
  • A programming technique for generating minimal paths a general network
  • Published at:Computers & Industrial Engineering, Volume 31, Issues 1-2, October 1996, Pages 389-392
  • This paper presents a heuristic technique for deducing minimal paths of a network. It generates only minimal paths, without explicitly determining whether or not a path is minimal This technique has been implemented on a digital computer to generate a minimal path matrix. It terms of computational speed, the results obtained compare well with existing algorithms. The technique requires minimum storage in memory and minimum user-defined data to represent the topology of a network and follows a modular design strategy. Use of the algorithm is illustrated by examples.

  • Bookmark and Share Email
Leave a Comment


  • No Attachments Found for this Article


Amjed Mahmoud Muhammad Al-Ghanim
Show Full Profile


Please do not email me if you do not know me
Please do not e-mail me if you do not know me