Results 1  10
of
17
Universal Facility Location
 in Proc. of ESA ’03
, 2003
"... In the Universal Facility Location problem we are given a set of demand points and a set of facilities. ..."
Abstract

Cited by 33 (0 self)
 Add to MetaCart
In the Universal Facility Location problem we are given a set of demand points and a set of facilities.
The pmedian problem: A survey of metaheuristic approaches
 European J Operational Research 179 927
, 2007
"... The pmedian problem, like most location problems, is classified as NPhard, and so, heuristic methods are usually used for solving it. The pmedian problem is a basic discrete location problem with real application that have been widely used to test heuristics. Metaheuristics are frameworks for bui ..."
Abstract

Cited by 25 (2 self)
 Add to MetaCart
The pmedian problem, like most location problems, is classified as NPhard, and so, heuristic methods are usually used for solving it. The pmedian problem is a basic discrete location problem with real application that have been widely used to test heuristics. Metaheuristics are frameworks for building heuristics. In this survey, we examine the pmedian, with the aim of providing an overview on advances in solving it using recent procedures based on metaheuristic rules.
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 12 (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.
AFFINITY PROPAGATION: CLUSTERING DATA BY PASSING MESSAGES
, 2009
"... Clustering data by identifying a subset of representative examples is important for detecting patterns in data and in processing sensory signals. Such “exemplars ” can be found by randomly choosing an initial subset of data points as exemplars and then iteratively refining it, but this works well on ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
(Show Context)
Clustering data by identifying a subset of representative examples is important for detecting patterns in data and in processing sensory signals. Such “exemplars ” can be found by randomly choosing an initial subset of data points as exemplars and then iteratively refining it, but this works well only if that initial choice is close to a good solution. This thesis describes a method called “affinity propagation ” that simultaneously considers all data points as potential exemplars, exchanging realvalued messages between data points until a highquality set of exemplars and corresponding clusters gradually emerges. Affinity propagation takes as input a set of pairwise similarities between data points and finds clusters on the basis of maximizing the total similarity between data points and their exemplars. Similarity can be simply defined as negative squared Euclidean distance for compatibility with other algorithms, or it can incorporate richer domainspecific models (e.g., translationinvariant distances for comparing images). Affinity propagation’s computational and memory requirements scale linearly with the number of similarities input; for nonsparse problems where all possible similarities are computed, these requirements scale quadratically with the number of data points. Affinity propagation is demonstrated on several applications
Primaldual variable neighborhood search for the simple plant location problem
 INFORMS Journal on Computing
"... doi 10.1287/ijoc.1060.0196 ..."
(Show Context)
A tabu search heuristic procedure for the capacitated facility location problem
 Journal of Heuristics
"... Copyright ©2006 by the UTSA College of Business. All rights reserved. This document can be downloaded without charge for educational purposes from the UTSA College of Business Working Paper Series (business.utsa.edu/wp) without explicit permission, provided that full credit, including © notice, is g ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
Copyright ©2006 by the UTSA College of Business. All rights reserved. This document can be downloaded without charge for educational purposes from the UTSA College of Business Working Paper Series (business.utsa.edu/wp) without explicit permission, provided that full credit, including © notice, is given to the source. The views expressed are those of the individual author(s) and do not necessarily reflect official positions of UTSA, the College of Business, or any individual department. ONE UTSA CIRCLE
The maximum returnoninvestment plant location problem
 J. Opl. Res. Soc
, 2000
"... Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilite ́ de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Les textes publiés dans la série des rapports de recherche HEC n’engagent que la responsabilite ́ de leurs auteurs. La publication de ces rapports de recherche bénéficie d’une subvention du Fonds québécois de la recherche sur la nature et les technologies.
Designing and Implementing Strategies for Solving Large LocationAllocation Problems with Heuristic Methods
, 1991
"... Solution techniques for locationallocation problems usually are not a part of microcomputer based geoprocessing systems. The large volumes of data to process and store and the complexity of algorithms present a barrier to implementation of these solution techniques in a microcomputer environment ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Solution techniques for locationallocation problems usually are not a part of microcomputer based geoprocessing systems. The large volumes of data to process and store and the complexity of algorithms present a barrier to implementation of these solution techniques in a microcomputer environment. Yet decisionmakers need analysis systems that return solutions to location selection problems in real time. We show that processing requirements for the most accurate heuristic, locationallocation algorithm can be drastically reduced by preprocessing interpoint distance data as both candidate and demand strings and exploiting the spatial structure of locationallocation problems by updating an allocation table. Consequently, solution times increase approximately linearly with problem size. These developments allow the solution of large problems (3,000 nodes) in a microcomputerbased, interactive decisionmaking environment. These methods are implemented in a microcomputer system a...