Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models

标题
Approximating Covering Problems by Randomized Search Heuristics Using Multi-Objective Models
作者
关键词
-
出版物
EVOLUTIONARY COMPUTATION
Volume 18, Issue 4, Pages 617-633
出版商
MIT Press - Journals
发表日期
2010-06-29
DOI
10.1162/evco_a_00003

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

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

Create your own webinar

Interested in hosting your own webinar? Check the schedule and propose your idea to the Peeref Content Team.

Create Now