Search

A Java Implementation of the Branch and Bound Algorithm: The Asymmetric Traveling Salesman Problem

By: Pawel Kalczynski

Abstract

This paper revisits some 20-year-old algorithms and contributes to object technology by offering a description of the model and implementation of a generic package for solving discrete minimization problems with branch and bound method. In particular, the package is implemented for and tested on the Traveling Salesman Problem with asymmetric cost matrices.

Cite as:

Pawel Kalczynski, “A Java Implementation of the Branch and Bound Algorithm: The Asymmetric Traveling Salesman Problem”, Journal of Object Technology, Volume 4, no. 1 (January 2005), pp. 155-163, doi:10.5381/jot.2005.4.1.a5.

PDF | HTML | DOI | BiBTeX | Tweet this | Post to CiteULike | Share on LinkedIn