On locating new facilities in a competitive environment

DOI10.1016/0377-2217(83)90180-7zbMath0499.90026OpenAlexW1996342364MaRDI QIDQ1171986

Publication date: 1983

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

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90180-7

zbMATH Keywords

NP-hardness \(p\)-median \(p\)-center edge lengths vertex weights facility location on graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Continuous location (90B85)

Related Items (only showing first 100 items - show all)

Competitive location and pricing on networks with random utilities ⋮ Locating facilities in a competitive environment ⋮ The p-cover problem ⋮ Models and algorithms for competitive facility location problems with different customer behavior ⋮ How bad can a voting locating be ⋮ Competitive location on a network ⋮ Constrained location of competitive facilities in the plane ⋮ Improved algorithms for some competitive location centroid problems on paths, trees and graphs ⋮ The (1|1)-Centroid Problem in the Plane with Distance Constraints ⋮ On the conditional \(p\)-median problem ⋮ Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems ⋮ Hub location under competition ⋮ A branch-and-bound algorithm for the maximum capture problem with random utilities ⋮ Democratic elections and centralized decisions: Condorcet and approval voting compared with median and coverage locations ⋮ \(k\) best cuts for circular-arc graphs ⋮ Location equilibria for a continuous competitive facility location problem under delivered pricing ⋮ A Stackelberg hub arc location model for a competitive environment ⋮ A planar single-facility competitive location and design problem under the multi-deterministic choice rule ⋮ Solving multifacility Huff location models on networks using metaheuristic and exact approaches ⋮ \((r|p)\)-centroid problems on networks with vertex and edge demand ⋮ A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand ⋮ A robust model for a leader-follower competitive facility location problem in a discrete space ⋮ A Lagrangian heuristic algorithm for a public healthcare facility location problem ⋮ Incorporating waiting time in competitive location models ⋮ The leader-follower location model ⋮ Competitive location with rectilinear distances ⋮ The gravity multiple server location problem ⋮ An exact procedure and LP formulations for the leader-follower location problem ⋮ Reachability of locational Nash equilibria ⋮ Integer programming formulations for three sequential discrete competitive location problems with foresight ⋮ The leader multipurpose shopping location problem ⋮ A two-player competitive discrete location model with simultaneous decisions ⋮ Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches ⋮ Competitive facility location with random attractiveness ⋮ Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution ⋮ Isodistant points in competitive network facility location ⋮ Gradual cover competitive facility location ⋮ Cournot-Stackelberg games in competitive delocation ⋮ Sequential competitive location on networks ⋮ Competitive facility location and design with reactions of competitors already in the market ⋮ Competitive Facility Location with Selfish Users and Queues ⋮ Facility location for market capture when users rank facilities by shorter travel and waiting times ⋮ Voronoi game on graphs ⋮ Multiple voting location problems ⋮ Sequential Location Game on Continuous Directional Star Networks ⋮ GASUB: finding global optima to discrete location problems by a genetic-like algorithm ⋮ Retail location competition under carbon penalty ⋮ Single- and multi-objective defensive location problems on a network ⋮ On competition in a Stackelberg location-design model with deterministic supplier choice ⋮ On agglomeration in competitive location models ⋮ The wisdom of voters: evaluating the Weber objective in the plane at the Condorcet solution ⋮ A location-allocation problem for a web services provider in a competitive market ⋮ A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem ⋮ Competitive location in the plane ⋮ The \(p\)-median problem under uncertainty ⋮ Strategic multi-store opening under financial constraint ⋮ The maximum-capture hierarchical location problem ⋮ The follower competitive location problem with comparison-shopping ⋮ A heuristic method for large-scale multi-facility location problems ⋮ Location game on disjoint line segments ⋮ Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria. ⋮ Facility location models for distribution system design ⋮ On competitive sequential location in a network with a decreasing demand intensity ⋮ Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane ⋮ Location analysis: a synthesis and survey ⋮ Optimizing facility location and design ⋮ A GIS-based optimization framework for competitive multi-facility location-routing problem ⋮ Facility dependent distance decay in competitive location ⋮ Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem ⋮ Competitive facility location problem with attractiveness adjustment of the follower on the closed supply chain ⋮ Facilities location in a competitive environment: A Promethee based multiple criteria analysis ⋮ How to Calculate the Barycenter of a Weighted Graph ⋮ Technical Note—The Competitive Facility Location Problem in a Duopoly: Advances Beyond Trees ⋮ A competitive facility location problem on a tree network with stochastic weights. ⋮ Competitive location, production, and market selection ⋮ Location-allocation on a line with demand-dependent costs ⋮ Competitive location on networks under delivered pricing ⋮ LOCATION GAME ON THE PLANE ⋮ Location of retail facilities under conditions of uncertainty ⋮ On a branch-and-bound approach for a Huff-like Stackelberg location problem ⋮ On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems ⋮ Sequential location problems ⋮ A minimax regret model for the leader-follower facility location problem ⋮ \((r,p)\)-centroid problems on paths and trees ⋮ ON PLANAR MEDIANOID COMPETITIVE LOCATION PROBLEMS WITH MANHATTAN DISTANCE ⋮ VNS heuristic for the –centroid problem on the plane ⋮ Solving Multifacility Huff Location Models on Networks Using Variable Neighborhood Search and Multi-Start Local Search Metaheuristics ⋮ The discrete Voronoi game in a simple polygon ⋮ Perception and information in a competitive location model ⋮ OPEN PROBLEMS IN COOPERATIVE LOCATION GAMES ⋮ Sequential Location Models ⋮ Conditional Location Problems on Networks and in the Plane ⋮ Exploiting Structure: Location Problems on Trees and Treelike Graphs ⋮ Solving the multiple competitive facilities location problem ⋮ Networks with Condorcet solutions ⋮ Outcomes of voting and planning in single facility location problems ⋮ Discrete Competitive Facility Location: Modeling and Optimization Approaches ⋮ Solving the competitive discretionary service facility location problem ⋮ Two-player simultaneous location game: preferential rights and overbidding ⋮ An alternating heuristic for medianoid and centroid problems in the plane

Cites Work

This page was built for publication: On locating new facilities in a competitive environment