Results 1  10
of
10
Facility location models for distribution system design
, 2004
"... The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamenta ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
The design of the distribution system is a strategic issue for almost every company. The problem of locating facilities and allocating customers covers the core topics of distribution system design. Model formulations and solution algorithms which address the issue vary widely in terms of fundamental assumptions, mathematical complexity and computational performance. This paper reviews some of the contributions to the current stateoftheart. In particular, continuous location models, network location models, mixedinteger programming models, and applications are summarized.
On the TwoLevel Uncapacitated Facility Location Problem
 INFORMS J. COMPUT
, 1996
"... We study the twolevel uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call yfacilities and zfacilities, the problem is to decide which facilities of both types to open, and to which pair of y and zfacilities each client should be assigned, in order to sat ..."
Abstract

Cited by 16 (3 self)
 Add to MetaCart
We study the twolevel uncapacitated facility location (TUFL) problem. Given two types of facilities, which we call yfacilities and zfacilities, the problem is to decide which facilities of both types to open, and to which pair of y and zfacilities each client should be assigned, in order to satisfy the demand at maximum profit. We first present two multicommodity flow formulations of TUFL and investigate the relationship between these formulations and similar formulations of the onelevel uncapacitated facility location (UFL) problem. In particular, we show that all nontrivial facets for UFL define facets for the twolevel problem, and derive conditions when facets of TUFL are also facets for UFL. For both formulations of TUFL, we introduce new families of facets and valid inequalities and discuss the associated separation problems. We also characterize the extreme points of the LPrelaxation of the first formulation. While the LPrelaxation of a multicommodity formulation provi...
Valid inequalities and facets of the capacitated plant location problem
 Mathematical Programming
, 1989
"... Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitate ..."
Abstract

Cited by 9 (1 self)
 Add to MetaCart
Recently, several successful applications of strong cutting plane methods to combinatorial optimization problems have renewed interest in cutting plane methods, and polyhedral characterizations, of integer programming problems. In this paper, we investigate the polyhedral structure of the capacitated plant location problem. Our purpose is to identify facets and valid inequalities for a wide range of capacitated fixed charge problems that contain this prototype problem as a substructure. The first part of the paper introduces a family of facets for a version of the capacitated plant location problem with constant capacity K for all plants. These facet inequalities depend on K and thus differ fundamentally from the valid inequalities for the uncapacitated version of the problem. We also introduce a second formulation for a model with indivisible customer demand and show that it is equivalent to a vertex packing problem on a derived graph. We identify facets and valid inequalities for this version of the problem by applying known results for the vertex packing polytope.
A BranchandCut Algorithm for a Generalization of the Uncapacitated Facility Location Problem
 TOP
, 1995
"... We introduce a generalization of the wellknown Uncapacitated Facility Location Problem, in which clients can be served not only by single facilities but also by sets of facilities. The problem, called Generalized Uncapacitated Facility Location Problem (GUFLP), was inspired by the Index Selection P ..."
Abstract

Cited by 8 (2 self)
 Add to MetaCart
We introduce a generalization of the wellknown Uncapacitated Facility Location Problem, in which clients can be served not only by single facilities but also by sets of facilities. The problem, called Generalized Uncapacitated Facility Location Problem (GUFLP), was inspired by the Index Selection Problem in physical database design. We formulate GUFLP as a Set Packing Problem, showing that our model contains all the clique inequalities (in polynomial number). Moreover, we describe an exact separation procedure for oddhole inequalities, based on the particular structure of the problem. These results are used within a branchandcut algorithm for the exact solution of GUFLP. Computational results on two different classes of test problems are given.
Separating Lifted OddHole Inequalities to Solve the Index Selection Problem
 Discrete Applied Mathematics
, 1998
"... The Index Selection Problem (ISP) is a phase of fundamental importance in the physical design of databases, calling for a set of indexes to be built in a database so as to minimize the overall execution time for a given database workload. The problem is a generalization of the wellknown Uncapacitat ..."
Abstract

Cited by 5 (0 self)
 Add to MetaCart
The Index Selection Problem (ISP) is a phase of fundamental importance in the physical design of databases, calling for a set of indexes to be built in a database so as to minimize the overall execution time for a given database workload. The problem is a generalization of the wellknown Uncapacitated Facility Location Problem (UFLP). In [6], we formulate ISP as a set packing problem, showing that our mathematical model contains all the clique inequalities, and describe a branchandcut algorithm based on the separation of oddhole inequalities. In this paper, we describe an effective exact separation procedure for a suitablydefined family of lifted oddhole inequalities, obtained by applying a ChvátalGomory derivation to the clique inequalities. Our analysis goes in the direction of determining a new class of inequalities over which ecient separation is possible, rather than introducing new classes of (facetde ning) inequalities that later turn out to be difficult to separate. Our separation procedure is embedded within our branchandcut algorithm for the exact solution of ISP. Computational results on two different classes of instances are given, showing the e ectiveness of the new approach. We also test our algorithm on UFLP instances both taken from the literature and randomly generated.
Adapting Polyhedral Properties from Facility to Hub Location Problems
 Discrete Applied Mathematics
, 2004
"... We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the fields of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some cla ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We examine the feasibility polyhedron of the uncapacitated hub location problem (UHL) with multiple allocation, which has applications in the fields of air passenger and cargo transportation, telecommunication and postal delivery services. In particular we determine the dimension and derive some classes of facets for this polyhedron. We develop a general rule about lifting facets from the uncapacitated facility location (UFL) problem to UHL. Using this lifting procedure we obtain a new class of facets for UHL which dominates the inequalities in the original formulation.
Easy Instances Of The Plant Location Problem
, 1996
"... In this paper we describe properties of a particular transformation of the simple plant location problem into a vertex packing problem on a corresponding undirected graph. We characterize the undirected graphs that arise from simple plant location problems and we give a necessary and sufficient cond ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In this paper we describe properties of a particular transformation of the simple plant location problem into a vertex packing problem on a corresponding undirected graph. We characterize the undirected graphs that arise from simple plant location problems and we give a necessary and sufficient condition for such graphs to be perfect. This allows us to find a new family of polynomially solvable instances of the simple plant location problem. 3. 1. Introduction We assume familiarity with basic notions of graph theory (see, for instance, [3]). Let G be an undirected graph; a clique in G is any set of pairwise adjacent vertices; a stable set in G is any set of pairwise nonadjacent vertices. A clique or a stable set are called maximal if there exists no other clique or stable set containing them. The largest size of a clique and of a stable set in G is denoted by !(G) and ff(G), respectively. The vertex packing problem on an undirected graph G, with weights on its vertices, is to find i...
Lagrangean relaxation with clusters for the uncapacitated facility location problem
 in XIII CLAIO  Congreso LatinoIberoamericano de Investigación Operativa
, 2006
"... A good strategy for the solution of a largescale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that conne ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
A good strategy for the solution of a largescale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that connect the clusters of vertices, the conflict graph is divided in subgraphs with the same characteristics of the whole problem. When relaxing the removed edges in the lagrangean way, subproblems are solved and better limits than the traditional lagrangean relaxation are obtained. This work applies the LagClus to the Uncapacitated Facility
On the pmedian polytope of a special class of graphs
, 2005
"... Abstract. In this paper we consider a well known class of valid inequalities for the pmedian and the uncapacitated facility location polytopes, the odd cycle inequalities. It is known that their separation problem is polynomially solvable. We give a new polynomial separation algorithm based on a re ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. In this paper we consider a well known class of valid inequalities for the pmedian and the uncapacitated facility location polytopes, the odd cycle inequalities. It is known that their separation problem is polynomially solvable. We give a new polynomial separation algorithm based on a reduction from the original graph. Then, we define a nontrivial class of graphs, where the odd cycle inequalities together with the linear relaxations of both the pmedian and uncapacitated facility location problems, suffice to describe the associated polytope. To do this, we first give a complete description of the fractional extreme points of the linear relaxation for the pmedian polytope in that class of graphs. 1.
THE pMEDIAN POLYTOPE OF RESTRICTED YGRAPHS
"... Abstract. We further study the effect of odd cycle inequalities in the description of the polytopes associated with the pmedian and uncapacitated facility location problems. We show that the obvious integer linear programming formulation together with the odd cycle inequalities completely describe ..."
Abstract
 Add to MetaCart
Abstract. We further study the effect of odd cycle inequalities in the description of the polytopes associated with the pmedian and uncapacitated facility location problems. We show that the obvious integer linear programming formulation together with the odd cycle inequalities completely describe these polytopes for the class of restricted Ygraphs. This extends our results for the class of Yfree graphs. We also obtain a characterization of both polytopes for a bidirected path. 1.