Competitive location with rectilinear distances

DOI10.1016/0377-2217(93)E0239-TzbMath0927.90074OpenAlexW2052460865MaRDI QIDQ1129952

R. Infante-Macías, José Muñoz-Pérez

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0239-t

zbMATH Keywords

cliquecompetitive modelsrectilinear distanceslocating new facilities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Continuous location (90B85)

Related Items (9)

LARGE-SCALE SINGLE FACILITY CONTINUOUS LOCATION BY D.C. OPTIMIZATION ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Distributions of rectilinear deviation distance to visit a facility ⋮ Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game ⋮ The generalized maximal covering location problem ⋮ Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution ⋮ ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE ⋮ Sequential Location Models ⋮ An alternating heuristic for medianoid and centroid problems in the plane

Cites Work

• New perspectives in competitive location theory
• On locating new facilities in a competitive environment
• Facilities location in a competitive environment: A Promethee based multiple criteria analysis
• Competitive Location on a Network
• Weighted Assignment Models and Their Application
• Unnamed Item

This page was built for publication: Competitive location with rectilinear distances