@article{Florian1981, 
     author = "Florian, M. and Nguyen, S. and Pallottino, S.", 
     doi = "10.1002/net.3230110406", 
     issn = "00283045", 
     journal = "Networks", 
     link = "http://doi.wiley.com/10.1002/net.3230110406", 
     number = "4", 
     pages = "367--378", 
     title = "A dual simplex algorithm for finding all shortest paths", 
     uri = "http://doi.wiley.com/10.1002/net.3230110406", 
     volume = "11", 
     year = "1981", 
}

Problems: 178