Author:
Fortz Bernard,Gendron Bernard,Gouveia Luis
Publisher
Springer Nature Switzerland
Reference16 articles.
1. Balakrishnan, A., & Graves, S. C. (1989). A composite algorithm for a concave-cost network flow problem. Networks, 19(2), 175–202.
2. Correia, I., Gouveia, L., & Saldanha-da Gama, F. (2010). Discretized formulations for capacitated location problems with modular distribution costs. European Journal of Operational Research, 204(2), 237–244.
3. Croxton, K. L., Gendron, B., & Magnanti, T. L. (2003). A comparison of mixed-integer programming models for nonconvex piecewise linear cost minimization problems. Management Science, 49(9), 1268–1273.
4. Croxton, K. L., Gendron, B., & Magnanti, T. L. (2007). Variable disaggregation in network flow problems with piecewise linear costs. Operations Research, 55(1), 146–157.
5. Fortz, B., & Thorup, M. (2000). Internet traffic engineering by optimizing ospf weights. In: INFOCOM 2000. Nineteenth annual joint conference of the IEEE computer and communications societies. Proceedings (Vol. 2, pp. 519–528). IEEE.