An improved approximation ratio for the minimum latency problem
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Solution of the Cumulative Assignment Problem With a Well-Structured TabuSearch Method
Journal of Heuristics
Faster approximation algorithms for the minimum latency problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Industrial Engineering
Approximating the k-traveling repairman problem with repairtimes
Journal of Discrete Algorithms
An Improved Evolutionary Algorithm for Dynamic Vehicle Routing Problem with Time Windows
ICCS '07 Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007
A new formulation for the Traveling Deliveryman Problem
Discrete Applied Mathematics
Multi-robot routing with linear decreasing rewards over time
ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
An effective memetic algorithm for the cumulative capacitated vehicle routing problem
Computers and Operations Research
Branch and bound algorithm for a single vehicle routing problem with toll-by-weight scheme
IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part III
A simple and robust Simulated Annealing algorithm for scheduling workover rigs on onshore oil fields
Computers and Industrial Engineering
Computers and Operations Research
The machine learning and traveling repairman problem
ADT'11 Proceedings of the Second international conference on Algorithmic decision theory
The time dependent traveling salesman problem: polyhedra and branch-cut-and-price algorithm
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
The routing open shop problem: new approximation algorithms
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
The Delivery Man Problem with time windows
Discrete Optimization
A two-phase metaheuristic for the cumulative capacitated vehicle routing problem
Computers and Operations Research
Efficient approximation algorithms for the routing open shop problem
Computers and Operations Research
Physical search problems with probabilistic knowledge
Artificial Intelligence
Multiple agents maximum collection problem with time dependent rewards
Computers and Industrial Engineering
Natural and extended formulations for the Time-Dependent Traveling Salesman Problem
Discrete Applied Mathematics
| Hi-index | 0.00 |