Technical Note—On Partitioning the Feasible Set in a Branch-And-Bound Algorithm for the Asymmetric Traveling-Salesman Problem

Operations Research - United States
doi 10.1287/opre.21.1.340
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Related search

A Branch-And-Bound-Based Crossover Operator for the Traveling Salesman Problem

International Journal of Cognitive Informatics and Natural Intelligence
Human-Computer InteractionArtificial IntelligenceSoftware
2019English

Technical Note—Analysis of a Preference Order Traveling Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1981English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

Technical Note—Ann-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem

Operations Research
Management ScienceComputer Science ApplicationsOperations Research
1980English

A Method for the Traveling Salesman Problem Based on the Genetic Algorithm

Transactions of the Society of Instrument and Control Engineers
1995English

A Discrete Fruit Fly Optimization Algorithm for the Traveling Salesman Problem

PLoS ONE
Multidisciplinary
2016English

A Modified Ant Colony Algorithm for Traveling Salesman Problem

International Journal of Computers, Communications and Control
MathematicsComputer NetworksComputer Science ApplicationsComputational TheoryCommunications
2014English

Accelerating the Held-Karp Algorithm for the Symmetric Traveling Salesman Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2019English

The Traveling Salesman Problem

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy