On-line single-server dial-a-ride problems
Theoretical Computer Science
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms
Semi-preemptive routing on trees
Discrete Applied Mathematics
The network balance realized by routing organization system
KES-AMSTA'11 Proceedings of the 5th KES international conference on Agent and multi-agent systems: technologies and applications
Hardness of preemptive finite capacity dial-a-ride
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Semi-preemptive routing on a linear and circular track
Discrete Optimization
Hi-index | 0.05 |