A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Cutting Planes in Constraint Programming: A Hybrid Approach
CP '02 Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Computers and Operations Research
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
A New Memetic Algorithm for the Asymmetric Traveling Salesman Problem
Journal of Heuristics
Determination of the candidate arc set for the asymmetric traveling salesman problem
Computers and Operations Research
The Black and White Traveling Salesman Problem
Operations Research
Discrete Applied Mathematics
Computers and Operations Research
Engineering Applications of Artificial Intelligence
Solving permutational routing problems by population-based metaheuristics
Computers and Industrial Engineering
An evolutionary approach to the multidepot capacitated arc routing problem
IEEE Transactions on Evolutionary Computation
The Traveling Salesman Problem with Pickups, Deliveries, and Handling Costs
Transportation Science
Collaborative optimization under a control framework for ATSP
ICSI'11 Proceedings of the Second international conference on Advances in swarm intelligence - Volume Part I
Combined route capacity and route length models for unit demand vehicle routing problems
Discrete Optimization
The traveling purchaser problem, with multiple stacks and deliveries: A branch-and-cut approach
Computers and Operations Research
| Hi-index | 0.01 |