Algorithms for capacitated vehicle routing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
On-line single-server dial-a-ride problems
Theoretical Computer Science
Online Dial-a-Ride Problems: Minimizing the Completion Time
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Online Dial-a-Ride Problem under Reasonable Load
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
A Hard Dial-a-Ride Problem that is Easy on Average
Journal of Scheduling
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms
How to collect balls moving in the Euclidean plane
Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Semi-preemptive routing on trees
Discrete Applied Mathematics
Heuristics for the mixed swapping problem
Computers and Operations Research
A branch-and-cut algorithm for solving the Non-Preemptive Capacitated Swapping Problem
Discrete Applied Mathematics
Models for the single-vehicle preemptive pickup and delivery problem
Journal of Combinatorial Optimization
Semi-preemptive routing on a linear and circular track
Discrete Optimization
The uncapacitated swapping problem on a line and on a circle
Discrete Applied Mathematics
| Hi-index | 0.00 |