A Recursive Algorithm for Finding All Nondominated Extreme Points in the Outcome Set of a Multiobjective Integer Programme

References

• Aneja Y. P., Nair K. P. K. Bicriteria transportation problem. Management Sci. (1979) 25(1):73–78Link, Google Scholar
• Benson H. P. An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem. J. Global Optim. (1998a) 13(1):1–24Crossref, Google Scholar
• Benson H. P. Further analysis of an outcome set-based algorithm for multiple objective linear programming. J. Optim. Theory Appl. (1998b) 97(1):1–10Crossref, Google Scholar
• Benson H. P., Sun E. Outcome space partition of the weight set in multiobjective linear programming. J. Optim. Theory Appl. (2000) 105(1):17–36Crossref, Google Scholar
• Benson H. P., Sun E. A weight set decomposition algorithm for finding all efficient extreme points in the outcome set of a multiple objective linear program. Eur. J. Oper. Res. (2002) 139(1):26–41Crossref, Google Scholar
• Cohon J. L.Multiobjective Programming and Planning (1978) (Academic Press, New York) Google Scholar
• Ehrgott M., Wiecek M., Figueira J., Greco S., Ehrgott M. Multiobjective programming. Multicriteria Decision Analysis: State of the Art Surveys (2005) (Springer Science+Business Media, New York) 667–722Crossref, Google Scholar
• Gandibleux X., Morita H., Katoh N. A population-based metaheuristic for solving assignment problems with two objectives. J. Math. Model. Algorithms (2010) . ForthcomingGoogle Scholar
• Geoffrion A. M. Proper efficiency and the theory of vector maximization. J. Math. Anal. Appl. (1968) 22(3):618–630Crossref, Google Scholar
• Hamacher H. W., Ruhe G. On spanning tree problems with multiple objectives. Ann. Oper. Res. (1994) 52(4):209–230Crossref, Google Scholar
• Isermann H. Proper efficiency and the linear vector maximum problem. Oper. Res. (1974) 22(1):189–191Link, Google Scholar
• Papadimitriou C. H., Steiglitz K.Combinatorial Optimization (1982) (Prentice Hall, Englewood Cliffs, NJ) Google Scholar
• Przybylski A. Méthode en deux phases pour la résolution exacte de problèmes d'optimisation combinatoire comportant plusieurs objectifs: Nouveaux développements et application au problème d'affectation linéaire. (2006) . Ph.D. thesis, Faculté des Sciences et Techniques, Université de Nantes, Nantes, FranceGoogle Scholar
• Przybylski A., Gandibleux X., Ehrgott M. Two phase algorithms for the biobjective assignment problem. Eur. J. Oper. Res. (2008) 185(2):509–533Crossref, Google Scholar
• Ruhe G. Complexity results for multicriteria and parametric network flows using a pathological graph of Zadeh. Zeitschrift für Oper. Res. (1988) 32(1):9–27Crossref, Google Scholar
• Schweigert D., Colbourn C. J., Mahmoodian E. S. Vector-weighted matchings. Combinatorics Advances, Mathematics and Its Applications (1995) 329(Kluwer Academic Publishers, Dordrecht, The Netherlands) 267–276Crossref, Google Scholar
• Steuer R. E.Multiple Criteria Optimization: Theory, Computation and Application (1985) (John Wiley & Sons, New York) Google Scholar
• Tenfelde-Podehl D. A recursive algorithm for multiobjective combinatorial optimization problems with q criteria. (2003) . Technical report, Institut für Mathematik, Technische Universität Graz, Graz, AustriaGoogle Scholar
• Yu P. L., Zeleny M. The set of all nondominated solutions in linear cases and a multicriteria simplex method. J. Math. Anal. Appl. (1975) 49(2):430–468Crossref, Google Scholar