Routing under uncertainty: an application in the scheduling of field service engineers
The vehicle routing problem
A priori optimization for the probabilistic maximum independent set problem
Theoretical Computer Science
An Ant Colony Optimization Approach to the Probabilistic Traveling Salesman Problem
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Solving the Homogeneous Probabilistic Traveling Salesman Problem by the ACO Metaheuristic
ANTS '02 Proceedings of the Third International Workshop on Ant Algorithms
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Aggregation for the probabilistic traveling salesman problem
Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Solving a generalized traveling salesperson problem with stochastic customers
Computers and Operations Research
A hybrid scatter search for the probabilistic traveling salesman problem
Computers and Operations Research
Decision Support for Consumer Direct Grocery Initiatives
Transportation Science
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching
Transportation Science
The 2-dimensional probabilistic bin packing problem: an average case analysis of the FBS algorithm
MATH'08 Proceedings of the American Conference on Applied Mathematics
Vertex-Uncertainty in Graph-Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
Computers and Operations Research
Arc-Routing Models for Small-Package Local Routing
Transportation Science
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
A priori parallel machines scheduling
Computers and Industrial Engineering
New ideas for applying ant colony optimization to the probabilistic TSP
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
A constant approximation algorithm for the a priori traveling salesman problem
IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
Improved lower bounds for the universal and a priori TSP
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Optimal search path for service in the presence of disruptions
Computers and Operations Research
Scheduling with uncertainties on new computing platforms
Computational Optimization and Applications
Time Slot Management in Attended Home Delivery
Transportation Science
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Probabilistic coloring of bipartite and split graphs
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
On the probabilistic min spanning tree Problem
Journal of Mathematical Modelling and Algorithms
Algorithms for the universal and a priori TSP
Operations Research Letters
Stochastic vehicle routing with recourse
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |