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

Constrained spanning trees and the traveling salesman problem

โœ Scribed by Matthias Leclerc; Franz Rendl

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
441 KB
Volume
39
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A polynomial algorithm for a constrained
A polynomial algorithm for a constrained traveling salesman problem
โœ J.H. Rubinstein; D.A. Thomas; N.C. Wormald ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 125 KB

## Abstract We give a polynomialโ€time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. ยฉ 2001 John Wiley & Sons, Inc.

Submodularity and the traveling salesman
Submodularity and the traveling salesman problem
โœ Yale T. Herer ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 339 KB

In this paper we investigate the relationship between traveling salesman tour lengths and submodular functions. This work is motivated by the one warehouse multi-retailer inventory/distribution problem with traveling salesman tour vehicle routing costs. Our goal is to ยฎnd a submodular function whose

Reoptimizing the traveling salesman prob
Reoptimizing the traveling salesman problem
โœ Claudia Archetti; Luca Bertazzi; M. Grazia Speranza ๐Ÿ“‚ Article ๐Ÿ“… 2003 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 112 KB