Author:
Terlaky Tamás,Vannelli Anthony,Zhang Hu
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Anstreicher, K.M.: Towards a practical volumetric cutting plane method for convex programming. SIAM Journal on Optimization 9, 190–206 (1999)
2. Baltz, A., Srivastav, A.: Fast approximation of minimum multicast congestion - implementation versus theory. RAIRO Operations Research 38, 319–344 (2004)
3. Behjat, L.: New modeling and optimization techniques for the global routing problem. Ph.D. Thesis, University of Waterloo (2002)
4. Behjat, L., Vannelli, A., Rosehart, W.: Linear programming models for the global routing problem. To appear in Informs Journal on Computing (2004)
5. Bern, M., Plassmann, P.: The Steiner problem with edge lengths 1 and 2. Information Professing Letters 32, 171–176 (1989)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献