The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for...

The maximally diverse grouping problem requires finding a partition of a given set of elements into a fixed number of mutually disjoint subsets (or groups) i...

In this paper we propose a general variable neighborhood search heuristic for solving the uncapacitated single allocation p-hub center problem (USApHCP). F...

The uncapacitated multiple allocation p-hub center problem (UMApHCP) consists of choosing p hub locations from a set of nodes with pairwise traffic deman...

In this paper we show that the Clique Partitioning Problem can be reformulated in an equivalent form as the Maximally Diverse Grouping Problem (MDGP). We th...

Variable neighborhood search (VNS) is a meta-heuristic for solving optimization problems, whose basic idea is a systematic change of neighborhood structure...

Sequential clustering aims at determining homogeneous and/or well-separated clusters within a given set of entities, one at a time, until no more such clus...

We present a new general variable neighborhood search approach for the uncapacitated single allocation <i>p</i>-hub median problem in networks. This NP-hard ...

This paper considers the application of a Variable Neighborhood Search (VNS) algorithm for finite-horizon (<i>H</i> stages) Markov Decision Processes (MDPs),...

Variable neighborhood search (VNS) is a metaheuristic for solving combinatorial and global optimization problems whose basic idea is a systematic change o...

Data clustering methods have been developed extensively in the data mining literature for detecting useful patterns in large datasets in the form of dense...

In this survey, we examine an important class of facility location problems known as the multisource Weber problem (also referred to as the continuous locat...

We consider the problem of locating a circle with respect to existing facilities on the plane, such that the largest weighted distance between the circle and...

This paper presents a general mixed-norm minisum problem for locating a single facility in continuous space. It is assumed that several transportation modes...

The <i>p</i>-median problem is one of the basic models in discrete location theory. As with most location problems, it is classified as NP-hard, and so, heu...

The variable neighborhood search metaheuristic is applied to the primal simple plant location problem and to a reduced dual obtained by exploiting the compl...

This paper examines the plant location problem under the objective of maximizing return-on-investment. However, in place of the standard assumption that all...

The continuous location-allocation problem requires finding sites for <i>m</i> new facilities in the plane in order to serve <i>n</i> users such that the to...

This paper presents some new heuristics based on variable neighborhood search to solve the vertex weighted <i>k</i>-cardinality tree problem. An efficient l...

A constant fixed cost of establishing a facility is introduced within the framework of minisum facility location in the continuous space. The solution metho...

A zone-dependent fixed cost is introduced within the framework of minisum location of facilities in the continuous space. An efficient algorithm for determin...

This paper examines the convergence properties of two well-known heuristics: variable neighborhood search (VNS) and random multistart local search (MLS). Bot...

This paper studies the duality gap in the simple plant location problem, and presents general formulas for the gap when certain complementary slackness cond...

The pooling problem, which is fundamental to the petroleum industry, describes a situation where products possessing different attribute qualities are mixed...

This paper investigates a new variation in the continuous single facility location problem. Specifically, we address the problem of locating a new facility...

Reduction of some classes of global optimization programs to bilinear programs may be done in various ways, and the choice of method clearly influences the ...

This paper considers the problem of locating a facility not among demand points, as is usually the case, but among demand regions which could be market area...

We consider the problem of locating a line or a line segment in three-dimensional space, such that the sum of distances from the facility represented by the...

We consider a given set of offshore platforms and onshore wells, producing known (or estimated) amounts of oil, to be connected to a port. Connections may t...

This study investigates a new phenomenon of degeneracy in the multi-source Weber problem. This phenomenon relates to the existence of solutions in which one...

The multisource Weber problem is to locate simultaneously <i>m</i> facilities in the Euclidean plane in order to minimize the total transportation cost for ...

This paper investigates a new phenomenon of degeneracy in the continuous location-allocation problem. This phenomenon relates to the existence of solutions ...

Local descent methods typically employ a single neighbourhood structure to conduct the search around a candidate solution. In this paper, we propose a metho...

Several heuristic methods have been developed to solve the location-allocation problem in continuous space. Typically, these algorithms attempt to move in d...

The multi-source Weber problem requires locating <i>m</i> new facilities in continuous space in order to minimize a sum of transportation costs to <i>n</i> ...