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> ...