The p-median problem is a classic discrete location problem with numerous applications. It
aims to open p sites while minimizing the sum of the distances of each client to its nearest …

A multiphase approach that incorporates demand points aggregation, Variable
Neighbourhood Search (VNS) and an exact method is proposed for the solution of large …

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, the multi-product facility location problem in a two-stage supply chain is
investigated. In this problem, the locations of depots (distribution centres) need to be …

Large-scale unconditional and conditional vertex p p-centre problems are solved using two
meta-heuristics. One is based on a three-stage approach whereas the other relies on a …

Incorporating big data in urban planning has great potential for better modeling of urban
dynamics and more efficiently allocating limited resources. However, big data may present …

A facility location problem is concerned with determining the location of some useful facilities
in such a way so to fulfil one or a few objective functions and constraints. We survey those …

Facility location problems form a broad class of optimization problems extremely popular in
combinatorial optimization and operations research. In every facility location problem, one …

The optimal diversity management problem (ODMP) arises in many application fields when
a company, producing a good and/or a service customizable with options, has to satisfy …

Closeness is a widely-used centrality measure in social network analysis. For a node it
indicates the inverse average shortest-path distance to the other nodes of the network. While …