A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme

INFORMS Journal on Computing

Volumn 22, Issue 3, 2010, Pages 371-386

  Przybylski, Anthony ^a   Gandibleux, Xavier ^a   Ehrgott, Matthias ^b  

^a CNRS   (France)

^b UNIVERSITY OF AUCKLAND   (New Zealand)

Author keywords

Efficient solution; Multiobjective integer programme; Nondominated extreme point; Weight space decomposition

Indexed keywords

EID: 77955482788     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1090.0342     Document Type: Article

References (19)

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