Optimal solution of set covering/partitioning problems using dual heuristics
Management Science
Cyclic transfer algorithms for multivehicle routing and scheduling problems
Operations Research
Discrete Mathematics
Heuristics for the traveling salesman problem with pickup and delivery
Computers and Operations Research
Drive: Dynamic Routing of Independent Vehicles
Operations Research
Decomposition of a Combined Inventory and Time Constrained Ship Routing Problem
Transportation Science
2-Path Cuts for the Vehicle Routing Problem with Time Windows
Transportation Science
A distributed geographic information system for the daily car pooling problem
Computers and Operations Research
A general heuristic for vehicle routing problems
Computers and Operations Research
Selected Topics in Column Generation
Operations Research
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research
An Exact Algorithm for the Multiple Vehicle Pickup and Delivery Problem
Transportation Science
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
Ant colony optimization for real-world vehicle routing problems
ACM SIGEVOlution
The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
The combined manpower-vehicle routing problem for multi-staged services
Expert Systems with Applications: An International Journal
A Branch-and-Price Method for a Liquefied Natural Gas Inventory Routing Problem
Transportation Science
A column generation heuristic for the general vehicle routing problem
LION'10 Proceedings of the 4th international conference on Learning and intelligent optimization
Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
Computers and Operations Research
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows
Operations Research
Hardness of preemptive finite capacity dial-a-ride
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Vehicle routing problem with time windows based on adaptive bacterial foraging optimization
ICIC'12 Proceedings of the 8th international conference on Intelligent Computing Theories and Applications
A comprehensive taxonomy for multi-robot task allocation
International Journal of Robotics Research
| Hi-index | 0.00 |