Author:
Kim Dukwon,Pan Xinyan,Pardalos Panos M.
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications,Economics, Econometrics and Finance (miscellaneous)
Reference18 articles.
1. Barr, R.S., Glover, F. and Klingman, D. (1981). A new optimization method for large scale fixed charge transportation problems. Operation Research, 29, 448–463.
2. Cabot, A.V. and Erenguc, S.S. (1984). Some branch-and-bound procedures for fixed-cost transportation problems. Naval Research Logistics Quarterly, 31, 145–154.
3. Crainic, T.G., Frangioni, A. and Gendron, B. (2001). Bundle-based relaxation methods for multicommodity capacitated fixed charge network design. Discrete Applied Mathematics, 112, 73–99.
4. Crainic, T.G., Gendreau, M. and Farvolden, J. (2000). A Simplex-based tabu search Method for capacitated network design. INFORMS, J. Computing, 12(3), 223-236.
5. Gendron, B. and Crainic T.G. (1994). Relaxation for multicommodity capacitated network design problems Publication CRT-965, Centre de Recherche Sur Les Transports, University of Montreal,
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献