A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
Survey of facial results for the traveling salesman polytope
Mathematical and Computer Modelling: An International Journal
Combined route capacity and route length models for unit demand vehicle routing problems
Discrete Optimization
Hi-index | 0.00 |