On Some Special Network Flow Problems: The Shortest Path Tour Problems