A Branch & Cut Algorithm for the Asymmetric Traveling Salesman Problem with Precedence Constraints
Computational Optimization and Applications
Combinatorial Optimization by Dynamic Contraction
Journal of Heuristics
Computational Optimization and Applications
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Polynomial-Time Separation of Simple Comb Inequalities
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Approach to Cactus Construction Applied to TSP Support Graphs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
TSP Cuts Which Do Not Conform to the Template Paradigm
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
Mathematics of Operations Research
The Black and White Traveling Salesman Problem
Operations Research
Computing finest mincut partitions of a graph and application to routing problems
Discrete Applied Mathematics
Branch and cut methods for network optimization
Mathematical and Computer Modelling: An International Journal
Survey of facial results for the traveling salesman polytope
Mathematical and Computer Modelling: An International Journal
Generating partitions of a graph into a fixed number of minimum weight cuts
Discrete Optimization
Hi-index | 0.00 |