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

1 February 1973

journal article
Published by Institute for Operations Research and the Management Sciences (INFORMS) in Operations Research

Vol. 21 (1) , 340-343
https://doi.org/10.1287/opre.21.1.340

Abstract

This note develops a branching scheme for a branch-and-bound algorithm for the traveling-salesman problem. It improves on the algorithm of Bellmore and Malone in that a partition of the feasible set is achieved at every vertex of the enumeration tree.

Keywords

NOTE
SALESMAN PROBLEM
BRANCHING SCHEME
TRAVELING SALESMAN
PARTITIONING THE FEASIBLE SET
VERTEX

This publication has 0 references indexed in Scilit: