Journal: Theoretical Computer Science

Found 6 papers in total
On-line single-server dial-a-ride problems
On-line single-server dial-a-ride problems
2001,
In this paper results on the dial-a-ride problem with a single server are presented....
The passport control problem or how to keep a dynamic service system load balanced?
The passport control problem or how to keep a dynamic service system load balanced?
2002,
In many real life situations (such as department stores, or passport control booths in...
On the landscape ruggedness of the quadratic assignment problem
On the landscape ruggedness of the quadratic assignment problem
2001,
Local-search-based heuristics have been demonstrated to give very good results to...
The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate
The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate
1995,
It is widely known that the Ford–Fulkerson procedure for finding the maximum...
Shortest paths without a map
Shortest paths without a map
1991,
We study several versions of the shortest-path problem when the map is not known in...
A sublinear parallel algorithm for some dynamic programming problems
A sublinear parallel algorithm for some dynamic programming problems
1992,
This paper presents a sublinear parallel algorithm for dynamic programming problems...
Papers per page: