Multi-objective integer programming: A general approach for generating all non-dominated solutions

European Journal of Operational Research - Tập 199 - Trang 25-35 - 2009
Melih Özlen1, Meral Azizoğlu2
1Department of Industrial Engineering, Hacettepe University, Ankara 06800, Turkey
2Department of Industrial Engineering, Middle East Technical University, Ankara 06531, Turkey

Tài liệu tham khảo

Ehrgott, 2006, A discussion of scalarization techniques for multiple objective integer programming, Annals of Operational Research, 147, 343, 10.1007/s10479-006-0074-z Ehrgott, 2000, A survey and annotated bibliography of multiobjective combinatorial optimization, OR Spectrum, 22, 425, 10.1007/s002910000046 2002, vol. 52 Ehrgott, 2004, Approximate solution methods for multiobjective combinatorial optimization, TOP, 12, 1, 10.1007/BF02578918 Klamroth, 2004, Integer programming duality in multiple objective programming, Journal of Global Optimization, 29, 1, 10.1023/B:JOGO.0000035000.06101.07 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 Laumanns, 2006, An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method, European Journal of Operational Research, 169, 932, 10.1016/j.ejor.2004.08.029 Sylva, 2004, A method for finding the set of non-dominated vectors for multiple objective integer linear programs, European Journal of Operational Research, 158, 46, 10.1016/S0377-2217(03)00255-8 Sylva, 2007, A method for finding well-dispersed subsets of non-dominated vectors for multiple objective mixed integer linear programs, European Journal of Operational Research, 180, 1011, 10.1016/j.ejor.2006.02.049