Algorithms for capacitated vehicle routing
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Increasing the weight of minimum spanning trees
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
On-line single-server dial-a-ride problems
Theoretical Computer Science
A Capacitated Vehicle Routing Problem on a Tree
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
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
The capacitated traveling salesman problem with pickups and deliveries on a tree
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
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 |