A small number of combinatorial optimization problems have search spaces that correspond to elementary landscapes, where the objective function f is an eigenfunction of the Laplacian that describes the neighborhood structure ...

Software Product Lines (SPLs) are families of related software systems, which provide different feature combinations. Different SPL testing approaches have been proposed. However, despite the extensive and successful use ...

In many logistic, telecommunications and computer networks, direct routing of commodities between any origin and destination is not viable due to economic and technological constraints. Hub locations problems (HLPs) are ...

In this article we provide an exact expression for computing the autocorrelation coefficient $\xi$ and the autocorrelation length $\ell$ of any arbitrary instance of the Quadratic Assignment Problem (QAP) in polynomial ...

Software Product Lines (SPLs) are families of related software products, each with its own set of feature combinations. Their commonly large number of products poses a unique set of challenges for software testing as it ...

Taxis are a quick and reliable mean of transportation, especially in those cities where the public transportation system is very inefficient. However, taxis rarely travel with full capacity, and its impact on traffic ...

En este trabajo se presenta la descomposición en landscapes elementales de un problema de optimización combinatoria: el problema de Diseño de Redes de Radio. La teoría de landscapes provee un marco formal en el cual un ...

An optimal recombination operator provides an optimal solution fulfilling the gene transmission property: the value of any variable in the offspring must be inherited from one of the parents. In the case of binary variables, ...

Efficient hill climbers have been recently proposed for single- and multi-objective pseudo-Boolean optimization problems. For $k$-bounded pseudo-Boolean functions where each variable appears in at most a constant number ...

Hill climbing algorithms are at the core of many approaches to solve optimization problems. Such algorithms usually require the complete enumeration of a neighborhood of the current solution. In the case of problems defined ...