Solving mixed 0-1programs by a lift-and-project method
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
The Rural Postman Problem on mixed graphs with turn penalties
Computers and Operations Research
Embedding Relaxations in Global Constraints for Solving TSP and TSPTW
Annals of Mathematics and Artificial Intelligence
Optimization-Oriented Global Constraints
Constraints
A neural network algorithm for the traveling salesman problem with backhauls
Computers and Industrial Engineering - Special issue: Focussed issue on applied meta-heuristics
The Asymmetric Traveling Salesman Problem: Algorithms, Instance Generators, and Tests
ALENEX '01 Revised Papers from the Third International Workshop on Algorithm Engineering and Experimentation
Reduced Cost-Based Ranking for Generating Promising Subproblems
CP '02 Proceedings of the 8th International Conference on Principles and Practice of Constraint Programming
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Discrete Applied Mathematics
Solving real-world ATSP instances by branch-and-cut
Combinatorial optimization - Eureka, you shrink!
Self-organizing feature maps for the vehicle routing problem with backhauls
Journal of Scheduling
Discrepancy-Based Additive Bounding Procedures
INFORMS Journal on Computing
Discrete Applied Mathematics
Engineering Applications of Artificial Intelligence
The traveling salesman: computational solutions for TSP applications
The traveling salesman: computational solutions for TSP applications
Are Stacker Crane Problems easy? A statistical study
Computers and Operations Research
Hi-index | 0.00 |