๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An enhanced beam search algorithm for the Shortest Common Supersequence Problem

โœ Scribed by Sayyed Rasoul Mousavi; Fateme Bahri; Farzaneh Sadat Tabataba

Book ID
113601756
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
432 KB
Volume
25
Category
Article
ISSN
0952-1976

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A tabu search algorithm for the Capacita
A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
โœ Sharaiha, Yazid M.; Gendreau, Michel; Laporte, Gilbert; Osman, Ibrahim H. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 150 KB ๐Ÿ‘ 2 views

The Capacitated Shortest Spanning Tree Problem consists of determining a shortest spanning tree in a vertex weighted graph such that the weight of every subtree linked to the root by an edge does not exceed a prescribed capacity. We propose a tabu search heuristic for this problem, as well as dynami