On-line algorithms for the dynamic traveling repair problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On-Line Algorithms for the Dynamic Traveling Repair Problem
Journal of Scheduling
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
Exploiting Knowledge About Future Demands for Real-Time Vehicle Dispatching
Transportation Science
New policies for the dynamic traveling salesman problem
Optimization Methods & Software
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
MDAI '07 Proceedings of the 4th international conference on Modeling Decisions for Artificial Intelligence
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
e-Work based collaborative optimization approach for strategic logistic network design problem
Computers and Industrial Engineering
Computers and Operations Research
Survey: The vehicle routing problem: A taxonomic review
Computers and Industrial Engineering
A hybrid honey bees mating optimization algorithm for the probabilistic traveling salesman problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
A priori parallel machines scheduling
Computers and Industrial Engineering
Estimation-based metaheuristics for the probabilistic traveling salesman problem
Computers and Operations Research
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
ICICS'09 Proceedings of the 7th international conference on Information, communications and signal processing
Approximation algorithms for optimal decision trees and adaptive TSP problems
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
An integer L-shaped algorithm for the Dial-a-Ride Problem with stochastic customer delays
Discrete Applied Mathematics
Stochastic minimum spanning trees in euclidean spaces
Proceedings of the twenty-seventh annual symposium on Computational geometry
Searching Steiner trees for web graph query
Computers and Industrial Engineering
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
The integer L-shaped method for stochastic integer programs with complete recourse
Operations Research Letters
DOE-based parameter tuning for local branching algorithm
International Journal of Metaheuristics
SIM-RandSHARP: a hybrid algorithm for solving the Arc Routing Problem with Stochastic Demands
Proceedings of the Winter Simulation Conference
International Journal of Applied Metaheuristic Computing
| Hi-index | 0.00 |