Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
A new optimization algorithm for the vehicle routing problem with time windows
Operations Research
Solving airline crew scheduling problems by branch-and-cut
Management Science
Mathematics of Operations Research
Worst-case analyses, linear programming and the bin-packing problem
Mathematical Programming: Series A and B
Discrete Mathematics
Polyhedral analysis and effective algorithms for the capacitated vehicle routing problem (set partitioning, column generation)
An efficient variable neighborhood search heuristic for very large scale vehicle routing problems
Computers and Operations Research
Active-guided evolution strategies for large-scale capacitated vehicle routing problems
Computers and Operations Research
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Exploiting sparsity in pricing routines for the capacitated arc routing problem
Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Survey: matheuristics for rich vehicle routing problems
HM'10 Proceedings of the 7th international conference on Hybrid metaheuristics
A Parallel Algorithm for the Vehicle Routing Problem
INFORMS Journal on Computing
A set partitioning reformulation of a school bus scheduling problem
Journal of Scheduling
A Parallel Algorithm for the Vehicle Routing Problem
INFORMS Journal on Computing
| Hi-index | 0.00 |