𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The asymmetric M-travelling salesmen problem: A duality based branch-and-bound algorithm

✍ Scribed by A Iqbal Ali; Jeff L Kennington

Publisher
Elsevier Science
Year
1986
Tongue
English
Weight
925 KB
Volume
13
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A branch and bound algorithm for the tra
A branch and bound algorithm for the traveling purchaser problem
✍ Kashi N. Singh; Dirk L. van Oudheusden πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm

A simplicial branch and duality bound al
A simplicial branch and duality bound algorithm for the sum of convex–convex ratios problem
✍ Pei-Ping Shen; Yun-Peng Duan; Yong-Gang Pei πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier Science 🌐 English βš– 601 KB

This article presents a simplicial branch and duality bound algorithm for globally solving the sum of convex-convex ratios problem with nonconvex feasible region. To our knowledge, little progress has been made for globally solving this problem so far. The algorithm uses a branch and bound scheme wh