1. Balakrishnan, A. (1987). LP extreme points and cuts for the fixed charge network design. Mathematical Programming, 39, 263–284.
2. Balakrishnan, A., Magnanti, T. L., & Mirchandani, P. (1997). Network design. In M. Dell’Amico, F. Maffioli, & S. Martello (Eds.), Annotated bibliographies in combinatorial optimization (pp. 311–334). New York: Wiley.
3. Balakrishnan, A., Magnanti, T. L., & Wong, R. (1989). A dual-ascent procedure for large-scale uncapacitated network design. Operations Research, 37(5), 716–740.
4. Balinski, M. L. (1961). Fixed-cost transportation problems. Naval Research Logistics, 8(1), 41–54.
5. Gendron, B., & Crainic, T. G. (1994). Relaxations for Multicommodity Capacitated Network Design Problems. Publication CRT-965, Centre for Research on Transportation, University of Montreal.