This paper is divided into two parts. In the first part of this paper, we present a 2-approximation algorithm for the soft-capacitated facility location problem. This achieves the integrality gap of the natural LP relaxation of the problem. The algorithm is based on an improved analysis of an algorithm for the linear facility location problem, and a bifactor approximate-reduction from this prob...

The Multiple Capacitated Facility Location Problem (MCFLP) is well-known and studied in the international literature optimization problem. The geographical information data of the enterprises’ locations are usually either ignored by the modeler or entered manually in these systems. In this paper, a spatial Decision Support System (DSS) is designed and implemented enabling co-located collaborati...

Facility location allocation problem is a very important issue in today's global logistic management. Various facility location problems have been considered in operations research under somehow stringent conditions to reduce the search space. In this paper, we consider a class of single source capacitated facility location allocation problems that can assume more realistic conditions in real l...

There has been a great deal of recent work on approximation algorithms for facility location problems [9]. We consider the capacitated facility location problem with hard capacities. We are given a set of facilities, F , and a set of clients D in a common metric space. Each facility i has a facility opening cost fi and capacity ui that specifies the maximum number of clients that may be assigne...

We investigate a multi-commodity capacitated facility location problem involving sustainability concerns (e.g., restrained carbon emission). In addition, this incorporates complementarity demand function. show that incorporation can lead to superior decisions both analytically and computationally. The resultant formulation is 0–1 mixed-integer non-concave quadratic program with equilibrium cons...