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

DOI10.1007/3-540-36970-8_36MaRDI QIDQ4424323zbMATH OpenFDO

Authors Oliver Schütze

Publication date 4 September 2003

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2632/26320509.htm

Mathematics Subject Classification ID

Data structures (68P05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 3936958
• Recent developments in screening methods for nondominated solutions in multiobjective optimization
• scientific article; zbMATH DE number 3889305
• Data structures in multi-objective evolutionary algorithms
• Approximating nondominated sets in continuous multiobjective optimization problems

Cited in

(7)

• Efficient computation of the search region in multi-objective optimization
• Covering Pareto sets by multilevel subdivision techniques
• Approximate non-dominated sorting for evolutionary many-objective optimization
• Data structures in multi-objective evolutionary algorithms
• Maxima-finding algorithms for multidimensional samples: A two-phase approach
• A fast incremental BSP tree archive for non-dominated points
• Set-oriented multiobjective optimal control of PDEs using proper orthogonal decomposition

This page was built for publication: A new data structure for the nondominance problem in multi-objective optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4424323)