✦ LIBER ✦

Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

✍ Scribed by D.L. Miller; J.F. Pekny

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 492 KB
Volume: 8
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(89)90038-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A parallel 2-opt algorithm for the Trave

A parallel 2-opt algorithm for the Traveling Salesman Problem

✍ M.G.A. Verhoeven; E.H.L. Aarts; P.C.J. Swinkels 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 823 KB

A branch-and-cut algorithm for the undir

A branch-and-cut algorithm for the undirected selective traveling salesman problem

✍ Gendreau, Michel; Laporte, Gilbert; Semet, Fr�d�ric 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 120 KB 👁 2 views

The Selective Traveling Salesman Problem (STSP) is defined on a graph in which profits are associated with vertices and costs are associated with edges. Some vertices are compulsory. The aim is to construct a tour of maximal profit including all compulsory vertices and whose cost does not exceed a p

Computational implementation of a combin

Computational implementation of a combined branch and bound algorithm for the travelling-salesman problem

✍ I.Kh. Sigal 📂 Article 📅 1986 🏛 Elsevier Science ⚖ 588 KB

A branch and bound algorithm for the sym

A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation

✍ Ton Volgenant; Roy Jonker 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 538 KB

A branch-and-cut algorithm for the undir

A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem

✍ Jean-François Bérubé; Michel Gendreau; Jean-Yves Potvin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB 👁 1 views

## Abstract Given an undirected graph with edge costs and vertex prizes, the aim of the Prize Collecting Traveling Salesman Problem (PCTSP) is to find a simple cycle minimizing the total edge cost while collecting at least a minimum amount of prizes. In this article, we present a branch‐and‐cut alg

A branch-and-cut algorithm for the picku

A branch-and-cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks

✍ Jean-François Côté; Claudia Archetti; Maria Grazia Speranza; Michel Gendreau; Je 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

This article studies the pickup and delivery traveling salesman problem with multiple stacks. The vehicle contains a number of (horizontal) stacks of finite capacity for loading items from the rear of the vehicle. Each stack must satisfy the last-in-first-out constraint that states that any new item