Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...
Amin Coja-Oghlan, Sven Oliver Krumke, Till Nierhof...
In the pickup and delivery problem with time windows (PDPTW), capacitated vehicles must be routed to satisfy a set of transportation requests between given origins and destination...
Chung and Ross (SIAM J. Comput., 20, 1991) conjectured that the minimum number m(n, r) of middle-state switches for the symmetric 3-stage Clos network C(n, m(n, r), r) to be rearr...
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
IEEE 802.22 wireless regional area network (WRAN) is an emerging cognitive radio-based system. One of the major challenges for WRANs is how to efficiently schedule both channel sen...