Results 131 to 140 of about 2,210,593 (198)

The p-median problem under uncertainty

European Journal of Operational Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Oded Berman, Zvi Drezner
openaire   +2 more sources

Upgrading p-Median Problem on a Path

Journal of Mathematical Modelling and Algorithms in Operations Research, 2014
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ali Reza Sepasian, Freydoon Rahbarnia
openaire   +3 more sources

A gamma heuristic for the p-median problem

European Journal of Operational Research, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Rosing, KE (Kenneth), Revelle, C, Schilling, DA   +2 more
openaire   +3 more sources

A neural model for the p-median problem

Computers & Operations Research, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Enrique Domínguez, José Muñoz
openaire   +3 more sources

When closest is not always the best: The distributed p-median problem

Journal of the Operational Research Society, 2019
The classical p-median problem assumes that service to customers is always provided by the closest facility, while in practice, customers often interact for a variety of reasons with several of the facilities (not just the closest).
J. Brimberg, Andrea Maier, A. Schöbel
semanticscholar   +1 more source

Backbone of the p-Median Problem

2007
PMP is a well-known NP-hard problem with extensively wide applications in location science and clustering. In this paper, we presented computational complexity results about the backbone, the shared common parts of all the optimal solutions to the PMP.
He Jiang 0001, Xianchao Zhang 0001, Mingchu Li   +2 more
openaire   +2 more sources

On the conditional p-median problem

Computers & Operations Research, 1995
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

A Variable Neighborhood Search approach for the Hamiltonian p-median problem

Applied Soft Computing, 2019
The Hamiltonian p -Median Problem (HpMP) is a generalization of the well-known Traveling Salesman Problem (TSP), where the goal is to find p non-intersecting cycles in an undirected graph, minimizing the total sum of the costs of those p cycles. The HpMP
Alberto Herrán, J. Colmenar, A. Duarte
semanticscholar   +1 more source

Revisiting the Hamiltonian p-median problem: A new formulation on directed graphs and a branch-and-cut algorithm

European Journal of Operational Research, 2019
This paper studies the asymmetric Hamiltonian p-median problem, which consists of finding p mutually disjoint circuits of minimum total cost in a directed graph, such that each node of the graph is included in one of the circuits.
T. Bektaş, Luís Gouveia, Daniel Santos
semanticscholar   +1 more source

A Bionomic Approach to the Capacitated p-Median Problem

Journal of Heuristics, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Vittorio Maniezzo, Aristide Mingozzi, Roberto Baldacci   +2 more
openaire   +2 more sources