𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Planning horizons for the production smoothing problem: a heuristic search procedure

✍ Scribed by Chen-Hua Chung; In-Jazz Chen; George L.Y. Cheng

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
482 KB
Volume
16
Category
Article
ISSN
0360-8352

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