Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization

网站地图 | English | 公务邮箱

About the library

Background
History
Leadership
Organization

Opening Hours
Collections
Help Via Email

Electronic Information Resources

Construct, Merge, Solve & Adapt A new general algorithm for combinatorial optimization

详细信息查看全文

作者：Christian Blum^a ; ^b ; ^{christian.blum@ehu.es" class="auth_mail" title="E-mail the corresponding author} ; Pedro Pinacho^a ; ^c ; ^{ppinacho@santotomas.cl" class="auth_mail" title="E-mail the corresponding author} ; Manuel Ló ; pez-Ibá ; ñ ; ez^d ; ^{manuel.lopez-ibanez@manchester.ac.uk" class="auth_mail" title="E-mail the corresponding author} ; José ; A. Lozano^a ; ^{ja.lozano@ehu.es" class="auth_mail" title="E-mail the corresponding author}
关键词：Metaheuristics ; Exact solver ; Hybrid algorithms ; Minimum common string partition ; Minimum covering arborescence
刊名：Computers and Operations Research
出版年：2016
出版时间：April 2016
年：2016
卷：68
期：Complete
页码：75-88
全文大小：575 K

文摘

class="label">•: We present a new general algorithm for combinatorial optimization.
class="label">•: The algorithm combines probabilistic solution construction with an ILP solver.
class="label">•: The ILP solver is used to solve sub-instances to optimality.
class="label">•: First application example: minimum common string partition.
class="label">•: Second application example: minimum covering arborescence.

NGLC 2004-2010.National Geological Library of China All Rights Reserved.
Add:29 Xueyuan Rd,Haidian District,Beijing,PRC. Mail Add: 8324 mailbox 100083
For exchange or info please contact us via email.