๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by I.Kh. Sigal

Publisher
Elsevier Science
Year
1986
Weight
588 KB
Volume
26
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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

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