14 citations · 20 across the 13 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2018
Iterated Greedy Algorithms for the Hop-Constrained Steiner Tree Problem
Farzane Yahyanejad, Bahram Sadeghi Bigham
The Hop-Constrained Steiner Tree problem (HCST) is challenging NP-hard problem arising in the design of centralized telecommunication networks where the reliability constraints mat…
cs.DS2018
Greedy Harmony Search Algorithm for the Hop Constrained Connected Facility Location
Farzane Yahyanejad, Bahram Sadeghi Bigham
We present a simple, robust and efficient harmony search algorithm for the Hop Constrained Connected Facility Location problem (HCConFL). The HCConFL problem is NP-hard that models…
cs.DS2014★ 1 cited
Design, Implementation and Evaluation of MTBDD based Fuzzy Sets and Binary Fuzzy Relations
Hamid A. Toussi, Bahram Sadeghi Bigham
For fast and efficient analysis of large sets of fuzzy data, elimination of redundancies in the memory representation is needed. We used MTBDDs as the underlying data-structure to…