1. R.L. Banker, M. Guinard and S.K. Gupta, “An algorithm for generating efficient solutions to the multiple objective integer programming problem”, Working Paper, The Wharton School, University of Pennsylvania (1978).
2. R.E. Bellman,Dynamic programming (Princeton University Press, Princeton, NJ, 1957).
3. G.R. Bitran, “Linear multiple objective programs with zero—one variables”,Mathematical Programming 13 (1977) 121–139.
4. G.R. Bitran, “Theory and algorithms for linear multiple objective programs with zero–one variables”, Technical Report No. 150, Operations Research Center, Massachusetts Institute of Technology (1978).
5. V.J. Bowman, “On the relationship of the Tchebycheff norm and the efficient frontier of multiple criteria objectives”, in H. Thiriez and S. Zionts, eds.,Multiple criteria decision making (Jouy-en-Josas, France, 1975) (Springer-Verlag, Berlin, 1976) pp. 76–85.