A Branch & Cut algorithm for the prize-collecting capacitated location routing problem

IF 1.5 4区管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Top Pub Date : 2021-01-08 DOI:10.1007/s11750-020-00590-x

Daniel Negrotto, I. Loiseau

引用次数: 1

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

一种分割算法求解有奖有容位置路由问题

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Top 管理科学-运筹学与管理科学

CiteScore

3.70

自引率

0.00%

发文量

审稿时长

>12 weeks

期刊介绍： TOP publishes original papers that significantly contribute to the theory and methodology of Operations Research, or to the practice of Data Driven Decision Making through innovative applications of Operations Research.

期刊最新文献

Wind farm layout optimization under uncertainty Heuristics for flow shop rescheduling with mixed blocking constraints On properties of the set of awards vectors for a claims problem Generating hydro unit commitment instances Berge equilibria and the equilibria of the altruistic game