𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A linear relaxation heuristic for the generalized assignment problem

✍ Scribed by Michael A. Trick


Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
850 KB
Volume
39
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A tabu search heuristic for the Steiner
✍ 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