Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.

DOI10.1007/BF02578927zbMath1148.90332OpenAlexW1979471412MaRDI QIDQ703293

Rafael Suárez-Vega, Pablo Dorta-González, Dolores-Rosa Santos-Peñate

Publication date: 11 January 2005

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02578927

zbMATH Keywords

attractivenessCompetitive locationmedianoid

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (13)

Locating facilities in a competitive environment ⋮ A planar single-facility competitive location and design problem under the multi-deterministic choice rule ⋮ New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior ⋮ Planar location and design of a new facility with inner and outer competition: an interval lexicographical-like solution procedure ⋮ The leader-follower location model ⋮ Isodistant points in competitive network facility location ⋮ Estimating the Pareto Front of a Hard Bi-criterion Competitive Facility Location Problem ⋮ Sequential competitive location on networks ⋮ A continuum perspective of customer choice rules for competitive facility location problems ⋮ GASUB: finding global optima to discrete location problems by a genetic-like algorithm ⋮ Improving solution of discrete competitive facility location problems ⋮ Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models ⋮ Conditional Location Problems on Networks and in the Plane

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equity models in planar location
• Optimal sizes of facilities on a linear market
• Competitive spatial models
• On locating new facilities in a competitive environment
• GBSSS: The generalized big square small square method for planar single- facility location
• Discretization results for the Huff and Pareto-Huff competitive location models on networks
• The profit-maximizing weber problem
• Competitive Location Models: A Framework and Bibliography
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
• Static competitive facility location: an overview of optimisation approaches.

This page was built for publication: Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.