𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A new class of iterative Steiner tree heuristics with good performance

✍ Scribed by Kahng, A.B.; Robins, G.

Book ID
119777600
Publisher
IEEE
Year
1992
Tongue
English
Weight
974 KB
Volume
11
Category
Article
ISSN
0278-0070

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A New Approximation Algorithm for the St
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
✍ Hans JΓΌrgen PrΓΆmel; Angelika Steger πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 100 KB

In this paper we present an RNC approximation algorithm for the Steiner tree problem in graphs with performance ratio 5r3 and RNC approximation algorithms for the Steiner tree problem in networks with performance ratio 5r3 q β‘€ for all β‘€ ) 0. This is achieved by considering a related problem, the min

Heuristic Algorithm with Oscillation Str
Heuristic Algorithm with Oscillation Strategy for a New Class of Assignment Problem
✍ Jia-xiang LUO; Li-xin TANG; Yue-ming HU πŸ“‚ Article πŸ“… 2009 πŸ› Elsevier βš– 244 KB

A new class of assignment problem which roots in the optimization management of slabs in steel industry is considered in this article. Compared with the generalized assignment problem, flow constraints should be considered in this problem besides the capacity constraints when assigning items to knap