scholarly journals Efficient Algorithms for Solving Aggregate Keyword Routing Problems

Author(s):  
Qize Jiang ◽  
Weiwei Sun ◽  
Baihua Zheng ◽  
Kunjie Chen
2015 ◽  
Vol 57 (2) ◽  
pp. 166-174 ◽  
Author(s):  
H. CHARKHGARD ◽  
M. SAVELSBERGH

We investigate two routing problems that arise when order pickers traverse an aisle in a warehouse. The routing problems can be viewed as Euclidean travelling salesman problems with points on two parallel lines. We show that if the order picker traverses only a section of the aisle and then returns, then an optimal solution can be found in linear time, and if the order picker traverses the entire aisle, then an optimal solution can be found in quadratic time. Moreover, we show how to approximate the routing cost in linear time by computing a minimum spanning tree for the points on the parallel lines.


2018 ◽  
Vol 12 ◽  
pp. 25-41
Author(s):  
Matthew C. FONTAINE

Among the most interesting problems in competitive programming involve maximum flows. However, efficient algorithms for solving these problems are often difficult for students to understand at an intuitive level. One reason for this difficulty may be a lack of suitable metaphors relating these algorithms to concepts that the students already understand. This paper introduces a novel maximum flow algorithm, Tidal Flow, that is designed to be intuitive to undergraduate andpre-university computer science students.


2014 ◽  
Vol 36 (5) ◽  
pp. 1047-1064 ◽  
Author(s):  
Bin LIAO ◽  
Jiong YU ◽  
Tao ZHANG ◽  
Xing-Yao YANG

2012 ◽  
Vol 35 (3) ◽  
pp. 603-615 ◽  
Author(s):  
Fa ZHANG ◽  
Antonio Fernandez Anta ◽  
Lin WANG ◽  
Chen-Ying HOU ◽  
Zhi-Yong LIU

2020 ◽  
Vol 81 (10) ◽  
pp. 1884-1895
Author(s):  
A. M. Shevchenko ◽  
G. N. Nachinkina ◽  
M. V. Gorodnova
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document