𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A multifaceted heuristic for the orienteering problem

✍ Scribed by B. L. Golden; Qiwen Wang; Li Liu

Publisher
John Wiley and Sons
Year
1988
Tongue
English
Weight
451 KB
Volume
35
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A tabu search heuristic for the Steiner
A tabu search heuristic for the Steiner Tree Problem
✍ Gendreau, Michel; Larochelle, Jean-Francois; SansοΏ½, Brunilde πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 342 KB πŸ‘ 2 views

The Steiner Tree Problem (STP) in graphs is a well-known NP-hard problem. It has regained attention due to the introduction of new telecommunication technologies, such as ATM, since it appears as the inherent mathematical structure behind multicast communications. In this paper, we present a tabu se

A heuristic network procedure for the as
A heuristic network procedure for the assembly line balancing problem
✍ Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala πŸ“‚ Article πŸ“… 1978 πŸ› John Wiley and Sons 🌐 English βš– 417 KB

## Abstract Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally y