References
- Abdulhakim, F. Z. 2013. “Linear Capacity and Heuristic Algorithms for Multicommodity Flow in Computer Networks Engineering.” In Advanced Materials Research, 926–931. Trans Tech Publications.
- Aloise, D., and C. C. Ribeiro. 2011. “Adaptive Memory in Multistart Heuristics for Multicommodity Network Design.” Journal of Heuristics 17 (2): 153–179. doi:https://doi.org/10.1007/s10732-010-9130-6.
- Alvarez, A. M., J. L. González-Velarde, and K. de-Alba. 2005. “GRASP Embedded Scatter Search for the Multicommodity Capacitated Network Design Problem.” Journal of Heuristics 11 (3): 233–257. doi:https://doi.org/10.1007/s10732-005-1509-4.
- Assad, A. A. 1978. “Multicommodity Network Flows—a Survey.” Networks 8 (1): 37–91. doi:https://doi.org/10.1002/net.3230080107.
- Barnhart, C., C. A. Hane, E. L. Johnson, and G. Sigismondi. 1994. “A Column Generation and Partitioning Approach for Multi-commodity Flow Problems.” Telecommunication Systems 3 (3): 239–258. doi:https://doi.org/10.1007/BF02110307.
- Barnhart, C., N. Krishnan, D. Kim, and K. Ware. 2002. “Network Design for Express Shipment Delivery.” Computational Optimization and Applications 21 (3): 239–262. doi:https://doi.org/10.1023/A:1013721018618.
- Barnhart, C., and Y. Sheffi. 1993. “A Network-based Primal-dual Heuristic for the Solution of Multicommodity Network Flow Problems.” Transportation Science 27 (2): 102–117. doi:https://doi.org/10.1287/trsc.27.2.102.
- Crainic, T. G., M. Gendreau, and J. M. Farvolden. 2000. “A Simplex-based Tabu Search Method for Capacitated Network Design.” INFORMS Journal on Computing 12 (3): 223–236. doi:https://doi.org/10.1287/ijoc.12.3.223.12638.
- Cruz, F. R. B., J. M. Smith, and G. R. Mateus. 1998. “Solving to Optimality the Uncapacitated Fixed-charge Network Flow Problem.” Computers & Operations Research 25 (1): 67–81. doi:https://doi.org/10.1016/S0305-0548(98)80010-5.
- Even, S., Itai, A., & Shamir, A. (1976). On the complexity of time table and multi-commodity flow problems. In 16th Annual Symposium on Foundations of Computer Science, (pp. 184–193). IEEE doi:https://doi.org/10.1109/SFCS.1975.21
- Farvolden, J. M., and W. B. Powell. 1994. “Subgradient Methods for the Service Network Design Problem.” Transportation Science 28 (3): 256–272. doi:https://doi.org/10.1287/trsc.28.3.256.
- Farvolden, J. M., W. B. Powell, and I. J. Lustig. 1993. “A Primal Partitioning Solution for the Arc-chain Formulation of A Multicommodity Network Flow Problem.” Operations Research 41 (4): 669–693. doi:https://doi.org/10.1287/opre.41.4.669.
- Frangioni, A., and G. Gallo. 1999. “A Bundle Type Dual-ascent Approach to Linear Multicommodity Min-cost Flow Problems.” INFORMS Journal on Computing 11 (4): 370–393. doi:https://doi.org/10.1287/ijoc.11.4.370.
- Gabrel, V., A. Knippel, and M. Minoux. 1999. “Exact Solution of Multicommodity Network Optimization Problems with General Step Cost Functions.” Operations Research Letters 25 (1): 15–23. doi:https://doi.org/10.1016/S0167-6377(99)00020-6.
- Guardia, L. T., and G. B. Lima. 2010. “Interior Point Methods for Linear Multicommodity Flow Problems.” In Proceeding of SR International Conference on Engineering optimization.
- Helme, M. P. 1992. “Reducing Air Traffic Delay in a Space-time Network.” In Systems, Man and Cybernetics, 1992., IEEE International Conference on. 236–242. IEEE.
- Holmberg, K., and D. Yuan. 2003. “A Multicommodity Network-flow Problem with Side Constraints on Paths Solved by Column Generation.” INFORMS Journal on Computing 15 (1): 42–57. doi:https://doi.org/10.1287/ijoc.15.1.42.15151.
- Kennington, J. L. 1978. “A Survey of Linear Cost Multicommodity Network Flows.” Operations Research 26 (2): 209–236. doi:https://doi.org/10.1287/opre.26.2.209.
- Kim, J.-G., H.-B. Jun, and C.-M. Kim. 2011. “A Two-phase Heuristic Algorithm for the Fixed-charge Capacitated Network Design Problem with Turn Penalties.” KSCE Journal of Civil Engineering 15 (6): 1125–1132. doi:https://doi.org/10.1007/s12205-011-1318-2.
- Kirby, M. W., W. A. Hager, and P. Wong. 1986. “Simultaneous Planning of Wildland Management and Transportation Alternatives.” TIMS Studies in the Management Sciences 21: 371–387.
- Kleeman, M. P., B. A. Seibert, G. B. Lamont, K. M. Hopkinson, and S. R. Graham. 2012. “Solving Multicommodity Capacitated Network Design Problems Using Multiobjective Evolutionary Algorithms.” IEEE Transactions on Evolutionary Computation 16 (4): 49–471. doi:https://doi.org/10.1109/TEVC.2011.2125968.
- Lagos, C., B. Crawford, R. Soto, J.-M. Rubio, E. Cabrera, and F. Parades. 2014. “Combining Tabu Search and Genetic Algorithms to Solve the Capacitated Multicommodity Network Flow Problem.” Studies in Informatics and Control 23 (3): 266. doi:https://doi.org/10.24846/v23i3y201405.
- Lim, C., and J. C. Smith. 2007. “Algorithms for Discrete and Continuous Multicommodity Flow Network Interdiction Problems.” IIE Transactions 39 (1): 15–26. doi:https://doi.org/10.1080/07408170600729192.
- Lin, Z., and R. Kwan. 2017. “Multicommodity Flow Problems with Commodity Compatibility Relations.” In ITM Web of Conferences, Volume 14, 2017 The 12th International Conference Applied Mathematical Programming and Modelling–APMOD 2016. EDP Sciences.
- Maes, J., J. O. Mcclain, and L. N. Van Wassenhove. 1991. “Multilevel Capacitated Lotsizing Complexity and LP-based Heuristics.” European Journal of Operational Research 53 (2): 131–148. doi:https://doi.org/10.1016/0377-2217(91)90130-N.
- Malairajan, R. A., K. Ganesh, T. R. Lee, and S. P. Anbuudayasankar. 2013. “REFING: Heuristic to Solve Bi-objective Resource Allocation Problem with Bound and Varying Capacity.” International Journal of Operational Research 17 (2): 145–169. doi:https://doi.org/10.1504/IJOR.2013.053620.
- Masri, H., S. Krichen, and A. Guitouni. 2015. “A Multi-start Variable Neighborhood Search for Solving the Single Path Multicommodity Flow Problem.” Applied Mathematics and Computation 251: 132–142. doi:https://doi.org/10.1016/j.amc.2014.10.123.
- Oimoen, S. C. 2009. Dynamic Network Formation Using Ant Colony Optimization. Air Force Institute of Technology.
- Ouorou, A., P. Mahey, and J.-P. Vial. 2000. “A Survey of Algorithms for Convex Multicommodity Flow Problems.” Management Science 46 (1): 126–147. doi:https://doi.org/10.1287/mnsc.46.1.126.15132.
- Tadayon, B., and J. C. Smith. 2014. “Algorithms for an Integer Multicommodity Network Flow Problem with Node Reliability Considerations.” Journal of Optimization Theory and Applications 161 (2): 506–532. doi:https://doi.org/10.1007/s10957-013-0378-5.
- Topaloglu, H., and W. B. Powell. 2006. “Dynamic-programming Approximations for Stochastic Time-staged Integer Multicommodity-flow Problems.” INFORMS Journal on Computing 18 (1): 31–42. doi:https://doi.org/10.1287/ijoc.1040.0079.
- Wang, I. L. (2018). Multicommodity network flows: A survey, Part I: Applications and Formulations. International Journal of Operations Research, 15(4), 145–153
- Wei, K., et al. 2014. “A Simulated Annealing Based Heuristic for the Multi-source Single-path Multi-commodity Network Flow Problem.” In Service Systems and Service Management (ICSSSM), 2014 11th International Conference on. 1–6. IEEE.