A new formulation for the conditional p-median and p-center problems

Authors:
Oded Berman;Zvi Drezner
Affiliations:
Joseph L.Rotman School of Management, University of Toronto, 105 St. George Street, Toronto, Ontario, Canada M5S 3E6;Department of Information Systems and Decision Sciences, Steven G. Mihaylo College of Business and Economics, California State University-Fullerton, Fullerton, CA 92834, USA
Venue:
Operations Research Letters
Year:
2008

Citing 1
Cited 1

On the conditional p-median problem

Computers and Operations Research

A relaxation-based algorithm for solving the conditional p-center problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we discuss the conditional p-median and p-center problems on a network. Demand nodes are served by the closest facility whether existing or new. The formulation presented in this paper provided better results than those obtained by the best known formulation.