Results 121 to 130 of about 2,210,593 (198)
Some of the next articles are maybe not open access.
Extensions to the planar p-median problem
Annals of Operations Research, 2023zbMATH Open Web Interface contents unavailable due to conflicting licenses.
R. Church, Z. Drezner, P. Kalczynski
semanticscholar +4 more sources
A Hybrid Heuristic for the p-Median Problem
Journal of Heuristics, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. C. Resende, Renato F. Werneck
semanticscholar +3 more sources
Matheuristics for the capacitated p-median problem
International Transactions in Operational Research, 2015AbstractThe improvement in the performance of computers and mathematical programming techniques has led to the development of a new class of algorithms called matheuristics. Associated with an improvement of Mixed Integer Programming (MIP) solvers, these methods have successfully solved plenty of combinatorial optimization problems. This paper presents
F. Stefanello +2 more
semanticscholar +2 more sources
, 2015
The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is \( \mathcal{N}\mathcal{P} \)-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem.
Mark S. Daskin, K. Maass
semanticscholar +2 more sources
The p-median problem is central to much of discrete location modeling and theory. While the p-median problem is \( \mathcal{N}\mathcal{P} \)-hard on a general graph, it can be solved in polynomial time on a tree. A linear time algorithm for the 1-median problem on a tree is described. We also present a classical formulation of the problem.
Mark S. Daskin, K. Maass
semanticscholar +2 more sources
An Efficient Genetic Algorithm for the p-Median Problem
Annals of Operations Research, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
O. Alp, E. Erkut, Z. Drezner
semanticscholar +2 more sources
Parallel iterative solution-based tabu search for the obnoxious p-median problem
Computers & Operations Research, 2021The obnoxious p-median problem (OpM) is to determine a set of opened facilities such that the sum of distances between each client and the opened facilities is maximized. OpM is a general model that has a wide range of practical applications. However the
Jian Chang +3 more
semanticscholar +1 more source
Solving the p-median problem on regular and lattice networks
Computers & Operations Research, 2020The p-median problem is one of the true classic problems of location science and has been applied in many ways. It involves the location of p-facilities on a network where the objective is to minimize the weighted distance of serving all demand.
R. Church, Shaohua Wang
semanticscholar +1 more source
An iterated greedy algorithm for the obnoxious p-median problem
Engineering applications of artificial intelligence, 2020The obnoxious p-median problem (OpM) is one of the NP-hard combinatorial optimization problems, in which the goal is to find optimal places to facilities that are undesirable (e.g.
O. Gokalp
semanticscholar +1 more source
The hamiltonian p-median problem
European Journal of Operational Research, 1990The Hamiltonian p-median problem is to locate p depots to serve a given set of customers through p distinct Hamiltonian cycles at minimal total distribution cost. This may be modeled as a set partitioning problem with cost of a subset equal to the length of a shortest circuit of the subset.
Branco, I. M., Coelho, J. D.
openaire +1 more source