Sequential location problems
From MaRDI portal
Publication:1278482
DOI10.1016/S0377-2217(96)00216-0zbMath0917.90225MaRDI QIDQ1278482
Publication date: 22 February 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items
Estimating the circle closest to a set of points by maximum likelihood using the BHHH algorithm, Competitive location and pricing on networks with random utilities, The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane, Robust equilibria in location games, Unnamed Item, Improved algorithms for some competitive location centroid problems on paths, trees and graphs, The (1|1)-Centroid Problem in the Plane with Distance Constraints, Hub location under competition, 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, Exact method for the capacitated competitive facility location problem, \((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, Solving a huff-like competitive location and design model for profit maximization in the plane, A genetic algorithm for the \(p\)-median problem with pos/neg weights, The leader-follower location model, An exact procedure and LP formulations for the leader-follower location problem, Integer programming formulations for three sequential discrete competitive location problems with foresight, A two-player competitive discrete location model with simultaneous decisions, Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection, Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences, A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design, The discrete facility location problem with balanced allocation of customers, GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM, Sequential competitive location on networks, Competitive facility location and design with reactions of competitors already in the market, An upper bound for the competitive location and capacity choice problem with multiple demand scenarios, Bilevel competitive facility location and pricing problems, Approximation of the competitive facility location problem with MIPs, Optimization of competitive facility location for chain stores, Discrete models for competitive location with foresight, Sequential location of two facilities: comparing random to optimal location of the first facility, Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models, Static competitive facility location: an overview of optimisation approaches., Strategic design of competing supply chain networks with foresight, Methods for computing Nash equilibria of a location-quantity game, A leader-follower game in competitive facility location, On Nash equilibria of a competitive location-design problem, On competitive sequential location in a network with a decreasing demand intensity, Planar expropriation problem with non-rigid rectangular facilities, Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane, Finding all pure strategy Nash equilibria in a planar location game, Competitive location and pricing on a line with metric transportation costs, A comparison of formulations and solution methods for the minimum-envy location problem, A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand, Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree, 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, \((r,p)\)-centroid problems on paths and trees, An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon, Sequential Location Models, Conditional Location Problems on Networks and in the Plane, Two-player simultaneous location game: preferential rights and overbidding, An alternating heuristic for medianoid and centroid problems in the plane
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The role of indifference in sequential models of spatial competition: an example
- New perspectives in competitive location theory
- On locating new facilities in a competitive environment
- Reachability of locational Nash equilibria
- Competitive location on a network
- The Maximum Capture Problem Including Relocation
- Locational equilibrium of two facilities on a tree
- Product Positioning Under Price Competition
- The Maximum Coverage Location Problem
- Competitive Location on a Network
- Algorithms for Voting and Competitive Location on a Network
- Note—On a Modified One-Center Model
- Defensive Foresight Rather than Minimax: A Comment on Eaton and Lipsey's Model of Spatial Competition
- On Hierarchical Spatial Competition
- On Hotelling's "Stability in Competition"
- Location of Competing Facilities in a User-Optimizing Environment with Market Externalities
- Equivalence of Solutions to Network Location Problems
- Competitive Location Models: A Framework and Bibliography
