Skip to main content

Competitive Multifacility Location on Networks: the (rXp)‐Medianoid Problem

Buy Article:

$43.00 plus tax (Refund Policy)


We investigate the (rXp)‐medianoid problem for networks. This is a competitive location problem that consists of determining the locations of r facilities belonging to a firm in order to maximize its market share in a space where a competitor is already operating with p facilities. We consider six scenarios resulting from the combination of three customer choice rules (binary, partially binary, and proportional) with two types of services (essential and unessential).

Known discretization results about the existence of a solution for the set of nodes are extended. Some examples and computational experience using heuristic algorithms are presented.
No References
No Citations
No Supplementary Data
No Article Media
No Metrics

Document Type: Research Article

Publication date: 2004-08-01

  • Access Key
  • Free content
  • Partial Free content
  • New content
  • Open access content
  • Partial Open access content
  • Subscribed content
  • Partial Subscribed content
  • Free trial content
Cookie Policy
Cookie Policy
Ingenta Connect website makes use of cookies so as to keep track of data that you have filled in. I am Happy with this Find out more