1. Shortest chain subject to side conditions;Aneja;Networks,1983
2. An algorithm for the resource constrained shortest path problem;Beasley;Networks,1989
3. Bienstock, D., 1998. Experiments with a network design algorithm using ε-approximate linear programs, Technical Report, Columbia University
4. Bienstock, D., 1999. Approximately solving large-scale linear programs. I. Strengthening lower bounds and accelerating convergence, Technical Report, Columbia University
5. Boccia, M., Sforza, A., 1999. Path design for the fleet of low emission vehicles of the ATENA Project, Technical Report, University of Naples