DAFTAR PUSTAKA
Bayrakataroglu, E. (2006). Approximation Schemes for Multicommodity Flow Pro-blem. College of Computer and Information Science. Northeastern Universi-ty.
Castro, J. (2000). A Specialized Interior Point Algorithm for Multicomodity Net-work Flows. SIAM journal on Optiminization, 10(3): 852-877.
Chardaire, P., dan Lisser,A. (2002).Simplex and Interior Point Specialized Algo-rithms for Solving Non-Oriented Multicomodity Flow Problem. Operation Research, 50 (2): 260-276.
Dantzig, G.B., and Wolfe, P. (1961). The decomposition algorithm for linear pro-gramming. Econometrica, 29(4):767778.
Farvolden, J.M., Powell, W.B., and Lustig, I.J. (1993). A primal partitioning solu-tion for the arc-chain formulasolu-tion of a multicommodity network flow problem. Operations Research, 41(4):669693.
Frangioni, A., and Gallo, G. (1999). A bundle type dual-ascent approach to line-ar multicommodity min-cost flow problems. Informs Journal on Computing, 11:370393.
Goffin, J.L., Haurie, A., and Vial.J.P. (1992). Decomposition and nondifferen-tiable optimization with the projective algorithm. Management Science, 38(2):284302.
Larsson, T., and Yuan, D. (2004). An augmented lagrangian algorithm for large scale multicommodity routing. Computational Optimization and Applica-tions, 27(2):187215.
Lima, G.B., and Guardia, L.T. (2010). Interior Point Methods for Linear Multi-commodity Flow Problems. 2nd International Conference on Enggineering Optimation.
Mahey, P., and Duhamel, C. (2005). Multicommodity Flow Problem with a bound-ed number of paths: a flow deviation approach.
McBride, R.D., and Mamer, J.W. (2000). A decomposition-based pricing for largescale linear program : An application to the linear multicommodity flow problem. Management Science, 46:693-709.
Merle, O.D., and Vial, J.P. (2002). Proximal ACCPM, a cutting plane method for column generation and Lagrangian relaxation: application to the p-median problem. Technical report, Logilab, University of Geneva, 40 Bd du Pont dArve, CH-1211 Geneva,Switzerland
Orlin, J.B., and Bompadre, A. (2006). A simple Method for Improving the Primal Simplex Method for the Multicommodity Flow Problem. United States.
Orlin,J.B., Magnanti, T.L., and Ahuja,R.K. 1993. Network Flow: Theory, Algo-rithms, and Applications. Prantice Hall, Englewood Cliffs. New Jersey.
26
Ramamurthy, B., and Todimala, A. (2006). Approximation Algorithms for Sur-vivable Multicommodity Flow Problem with Application to Network Design, Computer Science and Engineering.
