A new data structure for the nondominance problem in multi-objective optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2632, Issue , 2003, Pages 509-518

  Schütze, Oliver ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL EFFICIENCY; DATA STRUCTURES; OPTIMIZATION; TREES (MATHEMATICS);

COMPUTATIONAL RESULTS; EFFICIENT COMPUTATION; QUAD TREES;

MULTIOBJECTIVE OPTIMIZATION;

EID: 35248815534     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36970-8_36     Document Type: Article

References (14)

1. J. L. Bentley. Multidimensional binary search trees used for associative searching. Communications of the ACM, pages 509-517, 1975.
2. J. L. Bentley and J. H. Friedmann. Data structures for range searching. Computing Surveys, 4:398-409, 1979.
3. M. Dellnitz, R. Elsässer, T. Hestermeyer, O. Schütze, and S. Sertl. Covering Pareto sets with multilevel subdivision techniques, to appear, 2002.
4. R. M. Everson, J.E. Fieldsend, and S. Singh. Full elite sets for multi-objective optimization. In I. C. Parmee, editor, Adaptive Computing in Design and Manufacture V, Springer, 2002.
5. F. P. Preparata and M. I. Shamos. Computational Geometry - An Introduction. Springer Verlag, 1988.
6. J. Fieldsend, R.M. Everson, and S. Singh. Using unconstrained elite archives for multi-objective optimisation, to appear, 2003.
7. R. A. Finkel and J. L. Bentley. Quad trees, a datastructure for retrieval on composite keys. Acta Informatica, 4:1-9, 1974.
8. P. Gupta, R. Janardan, M. Smid, and B. Dasgupta. The rectangle enclosure and point-dominance problems revisited. Int. J. Comput. Geom. Appl., 5:437-455, 1997.
9. W. Habenicht. Quad trees, a datatructure for discrete vector optimization problems. Lecture Notes in Economics and Mathematical Systems, 209:136-145, 1983.
10. M. de Berg and M. van Kreveld and M. Overmars and O. Scharzkopf. Computational Geometry: algorithms and applications. Springer Verlag, 1997.
11. E. M. McCreight. Priority search trees. SIAM Journal on Computing, 14:257-276, 1985.
12. S. Mostaghim, J. Teich, and A. Tyagi. Comparison of data structures for storing pareto-sets in moeas. Int. J. Comput. Geom. Appl., 5:437-455, 2002.
13. M. Sun and R. E. Steuer. InterQuad: An interactive quad tree based procedure for solving the discrete alternative multiple criteria problem. European Journal of Operational Research, 89:462-472, 1996.
14. M. Sun and R. E. Steuer. Quad trees and linear lists for identifying nondominated criterion vectors. INFORMS J. Comp., 8:367-375, 1996.