One of the basic problems in the field of discrete location is the p-median problem. In this
chapter we present and analyze several versions of the problem, but we can roughly define …

In this paper, we present a new method for detecting overlap** communities in networks
with a predefined number of clusters called LPAM (Link Partitioning Around Medoids). The …

Modern industry puts a lot of challenges on all the people involved. High quality standards
and high customization, tight deadlines, and small volumes of orders already pose a lot of …

This paper studies the problem of selecting relevant features in clustering problems, out of a
data-set in which many features are useless, or masking. The data-set comprises a set U of …

The problem of optimizing a multilinear polynomial f in 0–1 variables arises in applications
from many different areas. We are interested in resolution methods based on reformulating …

Lately, the problem of cell formation (CF) has gained a lot of attention in the industrial
engineering literature. Since it was formulated (more than 50 years ago), the problem has …

The paper is aimed at experimental evaluation of the complexity of the p-Median problem
instances, defined by m× n costs matrices, from several of the most widely used libraries …

We introduce usage of a reduction property of penalty-based formulation of pseudo-Boolean
polynomials as a mechanism for invariant dimensionality reduction in cluster analysis …

The p-median problem is a well-known NP-hard problem. Many heuristics have been
proposed in the literature for this problem. In this paper, we exploit a GPGPU parallel …

We introduce a novel approach for image edge detection based on pseudo-Boolean
polynomials for image patches. We show that patches covering edge regions in the image …