An algorithm for the bi-criterion integer programming problem

European Journal of Operational Research - Tập 25 - Trang 292-300 - 1986
L.G. Chalmet1
1Bell Telephone Manufacturing, Antwerpen, Belgium

Tài liệu tham khảo

Bitran, 1977, Linear multiple objective programs with zero-one variables, Mathematical Programming, 13, 121, 10.1007/BF01584332 Bitran, 1979, Theory and algorithms for linear multiple objective programs with zero-one variables, Mathematical Programming, 17, 362, 10.1007/BF01588256 Bitran, 1982, An combined approach to solve binary multicriteria problems, Naval Research Logistics Quarterly, 29, 181, 10.1002/nav.3800290202 Bowman, 1980, On the relationship of the Tchebycheff norm and the efficient frontier of multiple-criteria objectives, Lectures Notes in Economics and Mathematical Systems, 135, 76 Chalmet, 1982, An efficient algorithm for the bi-criterion integer programming problem Garfinkel, 1972 Geoffrion, 1968, Proper efficiency and the theory of vector maximization, Journal of Mathematical Analysis and Applications, 22, 618, 10.1016/0022-247X(68)90201-1 Karwan, 1982, An improved interactive multicriteria integer programming algorithm Klein, 1982, An algorithm for the multiple objective integer linear programming problem, European Journal of Operational Research, 9, 378, 10.1016/0377-2217(82)90182-5 Pasternak, 1973, Bicriterion mathematical programs with Boolean variables, 327 Steuer, 1983, An interactive weighted Tchebycheff procedure for multiple objective programming, Mathematical Programming, 26, 326, 10.1007/BF02591870 Villarreal, 1981, Multicriterion integer linear programming: A (hybrid) dynamic programming recursive approach, Mathematical Programming, 21, 204, 10.1007/BF01584241 Zionts, 1977, Integer linear programming with multiple objectives, Annals of Discrete Mathematics, 1, 551, 10.1016/S0167-5060(08)70760-X Zionts, 1976, An interactive programming method for solving the multiple criteria problem, Management Science, 22, 652, 10.1287/mnsc.22.6.652