Optimal Communication Spanning Tree (OCST) is a well-known NP-hard problem on the graph that seeks for the spanning tree with the lowest cost. The tree cost depends on the demand ...
Pham Trung Kien, Nguyen Duy Hiep, Huynh Thi Thanh ...
Aircraft sizing studies consist in determining the main characteristics of an aircraft starting from a set of requirements. These studies can be summarized as global constrained o...
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
Abstract- Branch-and-Bound and evolutionary algorithms represent two very different approaches for tackling combinatorial optimization problems. These approaches are not incompatib...
A Local Linear Embedding (LLE) module enhances the performance of two Evolutionary Computation (EC) algorithms employed as search tools in global optimization problems. The LLE em...