Results 1  10
of
49
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 36 (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.
Solving The Simple Plant Location Problem By Genetic Algorithm
 RAIRO Operations Research
, 2001
"... The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorit ..."
Abstract

Cited by 22 (0 self)
 Add to MetaCart
The simple plant location problem (SPLP) is considered and a genetic algorithm is proposed to solve this problem. By using the developed algorithm it is possible to solve SPLP with more than 1000 facility sites and customers. Computational results are presented and compared to dual based algorithms.
Efficient Method for Maximizing Bichromatic Reverse Nearest Neighbor ∗
"... Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper, we study a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs. Such a problem has many real life applications, including the problem of finding ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper, we study a related problem called MaxBRNN: find an optimal region that maximizes the size of BRNNs. Such a problem has many real life applications, including the problem of finding a new server point that attracts as many customers as possible by proximity. A straightforward approach is to determine the BRNNs for all possible points that are not feasible since there are a large (or infinite) number of possible points. To the best of our knowledge, the fastest known method has exponential time complexity on the data size. Based on some interesting properties of the problem, we come up with an efficient algorithm called MaxOverlap. Extensive experiments are conducted to show that our algorithm is many times faster than the bestknown technique. 1.
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 10 (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.
A Genetic Algorithm for the Index Selection Problem
 In Applications of Evolutionary Computing
, 2003
"... This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NPhard and known in the literature as the Index Selection Problem (ISP). ..."
Abstract

Cited by 10 (0 self)
 Add to MetaCart
This paper considers the problem of minimizing the response time for a given database workload by a proper choice of indexes. This problem is NPhard and known in the literature as the Index Selection Problem (ISP).
The design of reverse distribution networks: Models and solution procedures
 European Journal of Operational Research
, 2003
"... Reverse distribution, or the management of product return flows, induced by various forms of reuse of products and materials, has received growing attention throughout this decade. In this paper we discuss reverse distribution, and propose a mathematical programming model for a version of this probl ..."
Abstract

Cited by 9 (0 self)
 Add to MetaCart
Reverse distribution, or the management of product return flows, induced by various forms of reuse of products and materials, has received growing attention throughout this decade. In this paper we discuss reverse distribution, and propose a mathematical programming model for a version of this problem. Due to the complexity of the proposed model, we introduce a heuristic solution methodology for this problem. The solution methodology complements a heuristic concentration procedure, where subproblems with reduced sets of decision variables are iteratively solved to optimality. Based on the solutions from the subproblems, a final concentration set of potential facility sites is constructed, and this problem is solved to optimality. The potential facility sites are then expanded in a greedy fashion to obtain the final solution. This “heuristic expansion ” was also performed using the solution found with a greedy heuristic to provide a shortlist of potential facility sites. Computational tests demonstrate a great deal of promise for this solution method, as highquality solutions are obtained while expending modest computational effort.
On the average case performance of some greedy approximation algorithms for the uncapacitated facility location problem
 In STOC ’05
"... In combinatorial optimization, a popular approach to NPhard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guaranteed to produce a solution which is within a known multiplicative factor of optimal. Unfortunately, the known factor is oft ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
(Show Context)
In combinatorial optimization, a popular approach to NPhard problems is the design of approximation algorithms. These algorithms typically run in polynomial time and are guaranteed to produce a solution which is within a known multiplicative factor of optimal. Unfortunately, the known factor is often known to be large in pathological instances. Conventional wisdom holds that, in practice, approximation algorithms will produce solutions closer to optimal than their proven guarantees. In this paper, we use the rigorousanalysisofheuristics framework to investigate this conventional wisdom. We analyze the performance of 3 related approximation algorithms for the uncapacitated facility location problem (from [Jain, Mahdian, Markakis, Saberi, Vazirani, 2003] and [Mahdian, Ye, Zhang, 2002]) when each is applied to an instances created by placing n points uniformly at random in the unit square. We find that, with high probability, these 3 algorithms do not find asymptotically optimal solutions, and, also with high probability, a simple plane partitioning heuristic does find an asymptotically optimal solution.
Telecommunication and Location
, 2001
"... We review the models for telecommunication network design where there is a location problem involved. We classify the models into three classes as uncapacitated, capacitated and dynamic models. For each class, we discuss the core problem, its generalizations and the solution methods in the litera ..."
Abstract

Cited by 7 (1 self)
 Add to MetaCart
We review the models for telecommunication network design where there is a location problem involved. We classify the models into three classes as uncapacitated, capacitated and dynamic models. For each class, we discuss the core problem, its generalizations and the solution methods in the literature.
The Minimum Consistent Subset Cover Problem and its Applications in Data Mining
 KDD'07
, 2007
"... In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent subsets that cover X, where a subset of X is consistent if it satisfies t. The MCSC problem generalizes the traditional set ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
(Show Context)
In this paper, we introduce and study the Minimum Consistent Subset Cover (MCSC) problem. Given a finite ground set X and a constraint t, find the minimum number of consistent subsets that cover X, where a subset of X is consistent if it satisfies t. The MCSC problem generalizes the traditional set covering problem and has Minimum Clique Partition, a dual problem of graph coloring, as an instance. Many practical data mining problems in the areas of rule learning, clustering, and frequent pattern mining can be formulated as MCSC instances. In particular, we discuss the Minimum Rule Set problem that minimizes model complexity of decision rules as well as some converse kclustering problems that minimize the number of clusters satisfying certain distance constraints. We also show how the MCSC problem can find applications in frequent pattern summarization. For any of these MCSC formulations, our proposed novel graphbased generic algorithm CAG can be directly applicable. CAG starts by constructing a maximal optimal partial solution, then performs an exampledriven specifictogeneral search on a dynamically maintained bipartite assignment graph to simultaneously learn a set of consistent subsets with small cardinality covering the ground set. Our experiments on benchmark datasets show that CAG achieves good results compared to existing popular heuristics.
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 6 (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 efficient separation is possible, rather than introducing new classes of (facetdefining) 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 effectiveness of the new approach. We also test our algorithm on UFLP instances both taken from the literature and randomly generated.