1. Aissi, H., Mahjoub, R., McCormick, S.T., Queyranne, M.: A strongly polynomial time algorithm for multicriteria global minimum cuts. In: Lee, J., Vygen, J. (eds.) Proceedings of 17th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2014, Bonn, June 23–25, 2014. Lecture Notes in Computer Science, vol. 8494, pp. 25–36. Springer, Berlin (2014)
2. Aneja, Y.P., Nair, K.P.K.: Bicriteria transportation problem. Manag. Sci. 25, 73–78 (1979)
3. Bazgan, C., Hugot, H., Vanderpooten, D.: Solving efficiently the 0–1 multi-objective knapsack problem. Comput. Oper. Res. 36, 260–279 (2009)
4. Bazgan, C., Jamain, F., Vanderpooten, D.: Approximate Pareto sets of minimal size for multi-objective optimization problems. Oper. Res. Lett. 43, 1–6 (2015)
5. Bellman, R.: On a routing problem. Q. Appl. Math. 16, 87–90 (1958)