Results 1  10
of
429,835
The Hamiltonian p–median problem ∗
"... We deal, from a theoretical point of view, with the asymmetric Hamiltonian p–median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILPformulation based on a new class of inequalities (subtour number constraints) is presented. The associated ..."
Abstract
 Add to MetaCart
We deal, from a theoretical point of view, with the asymmetric Hamiltonian p–median problem. This problem, which has many applications, can be viewed as a mixed routing location problem. An ILPformulation based on a new class of inequalities (subtour number constraints) is presented
Methods for Solving the pMedian Problem: An Annotated Bibliography
, 2005
"... The pmedian problem is a graph theory problem that was originally designed for, and has been extensively applied to, facility location. In this bibliography, we summarize the literature on solution methods for the uncapacitated and capacitated pmedian problem on a graph or network. 1 ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
The pmedian problem is a graph theory problem that was originally designed for, and has been extensively applied to, facility location. In this bibliography, we summarize the literature on solution methods for the uncapacitated and capacitated pmedian problem on a graph or network. 1
A Hybrid Heuristic for the pMedian Problem
, 2003
"... Given n customers and a set F of m potential facilities, the pmedian problem consists in finding a subset of F with p facilities such that the cost of serving all customers is minimized. ..."
Abstract

Cited by 46 (11 self)
 Add to MetaCart
Given n customers and a set F of m potential facilities, the pmedian problem consists in finding a subset of F with p facilities such that the cost of serving all customers is minimized.
A Genetic Algorithm for the PMedian Problem
, 2001
"... Facilitylocation problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most wellknown facilitylocation problems is the pmedian problem. This work addresses an application of the capacitated pmedian problem to a realworld pro ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
Facilitylocation problems have several applications in telecommunications, industrial transportation and distribution, etc. One of the most wellknown facilitylocation problems is the pmedian problem. This work addresses an application of the capacitated pmedian problem to a real
The directional pmedian problem: Definition, complexity, and algorithms
, 2007
"... An instance of a pmedian problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. pMedian is polynomially solvable in one dimension but NPhard in two or more dimensions, when either the Eu ..."
Abstract

Cited by 8 (5 self)
 Add to MetaCart
An instance of a pmedian problem gives n demand points. The objective is to locate p supply points in order to minimize the total distance of the demand points to their nearest supply point. pMedian is polynomially solvable in one dimension but NPhard in two or more dimensions, when either
Lagrangean/Surrogate Heuristics for pMedian Problems
, 2000
"... : The pmedian problem is the problem of locating p facilities (medians) on a network so as to minimize the sum of all the distances from each demand point to its nearest facility. A successful approach to approximately solve this problem is the use of Lagrangean heuristics, based upon Lagrangean re ..."
Abstract

Cited by 19 (9 self)
 Add to MetaCart
: The pmedian problem is the problem of locating p facilities (medians) on a network so as to minimize the sum of all the distances from each demand point to its nearest facility. A successful approach to approximately solve this problem is the use of Lagrangean heuristics, based upon Lagrangean
Alternative Formulation for the pmedian Problem
"... Given a set of clients and a set of potential sites for facilities, several location problems consist of opening a set of sites and assigning each client to the closest open facility to it. It can be viewed as a variation of the uncapacitated facility location problem. We propose a new formulation o ..."
Abstract
 Add to MetaCart
Given a set of clients and a set of potential sites for facilities, several location problems consist of opening a set of sites and assigning each client to the closest open facility to it. It can be viewed as a variation of the uncapacitated facility location problem. We propose a new formulation
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
A Bionomic Approach to the Capacitated pmedian Problem
, 1998
"... This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated pmedian problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization problems ..."
Abstract

Cited by 16 (1 self)
 Add to MetaCart
This paper advocates the use of the bionomic algorithm, a recently proposed metaheuristic technique, as an effective method to solve capacitated pmedian problems (CPMP). Bionomic algorithms already proved to be an effective framework for finding good solutions to combinatorial optimization
Complexity of local search for the pmedian problem
, 2007
"... For the pmedian problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding local search problems are PLScomplete. In the average case we note that standard local descent algorithm is polynomial. A re ..."
Abstract

Cited by 3 (1 self)
 Add to MetaCart
For the pmedian problem we study complexity of finding a local minimum in the worst and the average cases. We introduce several neighborhoods and show that the corresponding local search problems are PLScomplete. In the average case we note that standard local descent algorithm is polynomial. A
Results 1  10
of
429,835