A two phase method for multi-objective integer programming and its application to the assignment problem with three objectives

Ulungu, 1995, The two phases method: An efficient procedure to solve bi-objective combinatorial optimization problems, Foundations of Computing and Decision Sciences, 20, 149 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 Przybylski, 2008, Two phase algorithms for the bi-objective assignment problem, Europen Journal of Operational Research, 185, 509, 10.1016/j.ejor.2006.12.054 Lee, 1993, Bicriteria network flow problems: integer case, European Journal of Operational Research, 66, 148, 10.1016/0377-2217(93)90213-7 Sedeño-Noda, 2001, An algorithm for the biobjective integer minimum cost flow problem, Computers & Operations Research, 28, 139, 10.1016/S0305-0548(99)00095-7 Visée, 1998, Two-phases method and branch and bound procedures to solve the bi-obective knapsack problem, Journal of Global Optimization, 12, 139, 10.1023/A:1008258310679 Ramos, 1998, The problem of the optimal biobjective spanning tree, European Journal of Operational Research, 111, 617, 10.1016/S0377-2217(97)00391-3 Ehrgott, 2003, The method of elastic constraints for multiobjective combinatorial optimization and its application in airline crew scheduling, 117 Mavrotas, 1998, A branch and bound algorithm for mixed zero-one multiple objective linear programming, European Journal of Operational Research, 107, 530, 10.1016/S0377-2217(97)00077-5 Ehrgott, 2006, A discussion of scalarization techniques for multiobjective integer programming, Annals of Operations Research, 147, 343, 10.1007/s10479-006-0074-z Hansen, 1979, Bicriterion path problems, vol. 177, 109 A. Przybylski, X. Gandibleux, M. Ehrgott, A recursive algorithms for finding all nondominated extreme points in the outcome set of a multiobjective integer program. INFORMS Journal on Computing (2010), in print (doi:10.1287/ijoc.1090.0342). Ehrgott, 2003, Computation of ideal and nadir values and implications for their use in MCDM methods, European Journal of Operational Research, 151, 119, 10.1016/S0377-2217(02)00595-7 Ehrgott, 2007, Bound sets for biobjective combinatorial optimization problems, Computers and Operations Research, 34, 2674, 10.1016/j.cor.2005.10.003 Pedersen, 2008, The bicriterion multi modal assignment problem: introduction, analysis, and experimental results, INFORMS Journal on Computing, 20, 400, 10.1287/ijoc.1070.0253 Chegireddy, 1987, Algorithms for finding k-best perfect matchings, Discrete Applied Mathematics, 18, 155, 10.1016/0166-218X(87)90017-5 Miller, 1997, Optimizing murty’s ranked assignment method, IEEE Transactions on Aerospace and Electronic Systems, 33, 851, 10.1109/7.599256 Pascoal, 2003, A note on new variant of Murty’s ranking assignments algorithm, 4OR. A Quarterly Journal of Operations Research, 1, 243 Pedersen, 2008, An algorithm for ranking assignments using reoptimization, Computers and Operations Research, 35, 3714, 10.1016/j.cor.2007.04.008 Pedersen, 2010, Erratum to “an algorithm for ranking assignments using reoptimization”, Computers and Operations Research, 37, 426 Murty, 1968, An algorithm for ranking all the assignments in order of increasing cost, Operations Research, 16, 682, 10.1287/opre.16.3.682 Hamacher, 1985, k best solutions to combinatorial optimization problems, Annals of Operations Research, 4, 123, 10.1007/BF02022039 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 Laumanns, 2005, An adaptive scheme to generate the pareto front based on the epsilon-constraint method, European Journal of Operational Research, 169, 932, 10.1016/j.ejor.2004.08.029 D. Tenfelde-Podehl, A recursive algorithm for multiobjective combinatorial optimization problems with q criteria, Technical report, Institut für Mathematik, Technische Universität Graz, 2003. Przybylski, 2009, Computational results for four exact methods to solve the three-objective assignment problem, vol. 618, 79 Sourd, 2008, A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem, INFORMS Journal on Computing, 20, 472, 10.1287/ijoc.1070.0260 Bazgan, 2009, Solving efficiently the 0–1 multi-objective knapsack problem, Computers & Operations Research, 36, 260, 10.1016/j.cor.2007.09.009