The p‐median problem is a network problem that was originally designed for, and has been
extensively applied to, facility location. In this bibliography, we summarize the literature on …

The Capacitated p-median problem (CPMP) seeks to solve the optimal location of p
facilities, considering distances and capacities for the service to be given by each median. In …

In the traditional wavelet neural network (WNN) prediction model, the parameter
optimization is performed using a unidirectional gradient descent algorithm, which has the …

The capacitated centred clustering problem (CCCP) consists of defining a set of clusters with
limited capacity and maximum proper similarity per cluster. Each cluster is composed of …

This paper proposes a scatter search-based heuristic approach to the capacitated clustering
problem. In this problem, a given set of customers with known demands must be partitioned …

The maximally diverse grouping problem (MDGP) is a relevant NP-hard optimization
problem with a number of real-world applications. However, solving large instances of the …

Purpose The purpose of this study is to formulate an algorithm designed to discern the
optimal routes for efficient municipal solid waste (MSW) collection. Design/methodology …

Clustering is a difficult and widely studied data mining task, with many varieties of clustering
algorithms proposed in the literature. Nearly all algorithms use a similarity measure such as …

The point-feature cartographic label placement problem (PFCLP) is an NP-hard problem,
which appears during the production of maps. The labels must be placed in predefined …

Data Mining is concerned with the discovery of interesting patterns and knowledge in data
repositories. Cluster Analysis which belongs to the core methods of data mining is the …