Approximate non-dominated sorting for evolutionary many-objective optimization

标题
Approximate non-dominated sorting for evolutionary many-objective optimization
作者
关键词
Evolutionary multi-objective optimization, Computational complexity, Non-dominated sorting, Approximation, Many-objective optimization
出版物
INFORMATION SCIENCES
Volume 369, Issue -, Pages 14-33
出版商
Elsevier BV
发表日期
2016-06-19
DOI
10.1016/j.ins.2016.06.007

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More

Become a Peeref-certified reviewer

The Peeref Institute provides free reviewer training that teaches the core competencies of the academic peer review process.

Get Started