This study attempts to solve the placement and chaining problem of 5G User Plane
Functions (UPFs) in a Multi-access Edge Computing (MEC) ecosystem. The problem is …

Since the appearance of Simulated Annealing algorithm it has shown to be an efficient
method to solve combinatorial optimization problems such as Boolean Satisfiability problem …

En el presente proyecto se llevará a cabo el estudio del Problema del Viajante de Comercio
(TSP) y su variante con Ventanas de Tiempo (TSPTW). Para cada uno de estos problemas …

This paper is about experiments for satisfiability problem using a new algorithm (GR-MM-
PBSA) that improves the algorithm Population-Based Simulated Annealing (PBSA). GR-MM …

Some attribute implications in an implicational base of a derived context of many-valued
context can be inferred from some other attribute implications together with its scales. The …

This paper presents the results of a newly developed hybrid Simulated Annealing–Direct
search Algorithm (SADS) for the optimization of mechanism synthesis for function generation …

The representation of Job Shop Scheduling Problem (JSSP) as the well known Satisfiabilty
Problem (SAT) is useful to find feasible schedules in an efficient way. One of the most …

The interaction parameter identification problem in thermodynamic models is an important
requirement and a common task in many areas of chemical engineering because these …

In this paper, an improved Simulated Annealing algorithm for Protein Folding Problem (PFP)
is presented. This algorithm called Cluster Perturbation Simulated Annealing (CPSA) is …

Protein structure prediction (PSP) with ab initio model problem is still a challenge in
bioinformatics on account of high computational complexity. To solve this problem within a …