A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Cutting Planes in Constraint Programming: A Hybrid Approach
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
SCIL - Symbolic Constraints in Integer Linear Programming
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
A cooperative parallel rollout algorithm for the sequential ordering problem
Parallel Computing - Special issue: Parallel computing in logistics
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Operations Research
Formulations and exact algorithms for the vehicle routing problem with time windows
Computers and Operations Research
A heuristic manipulation technique for the sequential ordering problem
Computers and Operations Research
Branch and Cut and Price for the Pickup and Delivery Problem with Time Windows
Transportation Science
Branch-and-cut for the pickup and delivery traveling salesman problem with FIFO loading
Computers and Operations Research
A hybrid particle swarm optimization approach for the sequential ordering problem
Computers and Operations Research
Multilayer survivable optical network design
INOC'11 Proceedings of the 5th international conference on Network optimization
The Traveling Salesman Problem with Draft Limits
Computers and Operations Research
Allocation, scheduling and voltage scaling on energy aware MPSoCs
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |