当前位置: X-MOL 学术Networks › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Plowing with precedence in polynomial time
Networks ( IF 2.1 ) Pub Date : 2020-08-28 , DOI: 10.1002/net.21987
Rodrigo A. Castro Campos 1 , Cynthia A. Rodríguez Villalobos 2 , Francisco Javier Zaragoza Martínez 1
Affiliation  

The plowing with precedence problem is a variant of the windy postman problem, where a plow is required to clean streets after a heavy snowfall with traversing costs depending on the direction of traversal as well as whether a street has been previously plowed or not. We prove that this problem can be solved in polynomial time under natural cost structures. We also propose heuristics for this problem, which compare favorably with the state of the art.

中文翻译:

多项式时间优先耕种

优先排序问题是有风邮递员问题的一种变体,在该问题中,大雪过后需要犁来清理街道,其穿越成本取决于穿越的方向以及先前是否曾进行过犁过。我们证明了在自然成本结构下该问题可以在多项式时间内解决。我们还提出了针对该问题的启发式方法,该方法与现有技术相比具有优势。
更新日期:2020-11-02
down
wechat
bug