Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Robert S. Garfinkel
Technical Note—On Partitioning the Feasible Set in a Branch-And-Bound Algorithm for the Asymmetric Traveling-Salesman Problem
Operations Research
Management Science
Computer Science Applications
Operations Research
Related publications
A Branch-And-Bound-Based Crossover Operator for the Traveling Salesman Problem
International Journal of Cognitive Informatics and Natural Intelligence
Human-Computer Interaction
Artificial Intelligence
Software
Technical Note—Analysis of a Preference Order Traveling Salesman Problem
Operations Research
Management Science
Computer Science Applications
Operations Research
A Memetic Algorithm for the Generalized Traveling Salesman Problem
Natural Computing
Computer Science Applications
Technical Note—Ann-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
Operations Research
Management Science
Computer Science Applications
Operations Research
A Method for the Traveling Salesman Problem Based on the Genetic Algorithm
Transactions of the Society of Instrument and Control Engineers
A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem
PLoS ONE
Multidisciplinary
A Modified Ant Colony Algorithm for Traveling Salesman Problem
International Journal of Computers, Communications and Control
Mathematics
Computer Networks
Computer Science Applications
Computational Theory
Communications
Accelerating the Held-Karp Algorithm for the Symmetric Traveling Salesman Problem
IEICE Transactions on Information and Systems
Electronic Engineering
Pattern Recognition
Hardware
Computer Vision
Electrical
Architecture
Artificial Intelligence
Software
The Traveling Salesman Problem