References

[1]
A. Balakrishnan, T.L. Magnanti and R.T. Wong, ``A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design'', Operations Research, 37, 716-740, (1989).
[2]
J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, North-Holland (1976).
[3]
V. Chvatal, Linear Programming, W.H.Freeman (1983)
[4]
M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman, San Francisco (1979).
[5]
N. Karmarkar, ``A new polynomial-time algorithm for linear programming'', Combinatorica, 4, 373-395, (1984).
[6]
P.H. Ng and R.L. Rardin, ``Commodity Family Extended Formulations of Uncapacitated Fixed Charge Network Flow Problems'', Networks, to appear, (1996).
[7]
R.L. Rardin and U. Choe, `` Tighter Relaxations of Fixed Charge Network Flow Problems '', Technical Report J-79-18, Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, Georgia, (1979).
[8]
Schrijver, A. [1986], Theory of Linear and Integer Programming, John Wiley & Sons Ltd.
[9]
D. West, Graph Theory with Applications, Prentice-Hall (1996).