A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem

标题
A matheuristic for the Distance-Constrained Close-Enough Arc Routing Problem
作者
关键词
Close-Enough Arc Routing Problem, Generalized directed Rural Postman Problem, Distance constraints, Matheuristic, multi-start
出版物
Top
Volume -, Issue -, Pages -
出版商
Springer Nature
发表日期
2019-03-16
DOI
10.1007/s11750-019-00507-3

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

Reprint

联系作者

Find Funding. Review Successful Grants.

Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.

Explore

Create your own webinar

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

Create Now