In this paper, we introduce, study and analyze several classes of compact formulations for the symmetric Hamiltonian p $$ -median problem (H MP). Given a positive integer weighted complete undirected graph G = ( V , E ) G=\left(V,E\right) with weights on edges, H MP is to find minimum weight set elementary cycles partitioning vertices . The advantage developing that they can be readily used in ...

By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...

Population-based memetic algorithms have been successfully applied to solve many difficult combinatorial problems. Often, a population of fixed size is used in such record some best solutions sampled during the search. However, given particular features problem instance under consideration, variable would be more suitable ensure search performance possible. In this work, we propose (VPMS), wher...