Solving the team orienteering problem with cutting planes
详细信息 查看全文
- 作者：Racha El-Hajja ; c ; racha.el-hajj@hds.utc.fr" class="auth_mail" title="E-mail the corresponding author ; Duc-Cuong Dangb ; duc-cuong.dang@nottingham.ac.uk" class="auth_mail" title="E-mail the corresponding author ; Aziz Moukrima ; aziz.moukrim@hds.utc.fr" class="auth_mail" title="E-mail the corresponding author
- 关键词：Team Orienteering Problem ; Cutting planes ; Dominance property ; Incompatibility ; Clique cut ; Independent-set cut
- 刊名：Computers and Operations Research
- 出版年：2016
- 出版时间：October 2016
- 年：2016
- 卷：74
- 期：Complete
- 页码：21-30
- 全文大小：819 K
文摘
- class="listitem" id="list_li0005">
- class="label">•
We propose an efficient cutting plane algorithm for the Team Orienteering Problem.
- class="label">•
Information retrieved from solving smaller and modified models is shown to be useful.
- class="label">•
The graphs of incompatibilities are exploited to construct strong cuts.
- class="label">•
The experimental result is competitive and complementary to those of the literature.
- class="label">•
12 previously unsolved benchmark instances are now solved to optimality.