Sequential location problems
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 9247 (Why is no real title available?)
- scientific article; zbMATH DE number 3512145 (Why is no real title available?)
- scientific article; zbMATH DE number 1253066 (Why is no real title available?)
- scientific article; zbMATH DE number 1253070 (Why is no real title available?)
- scientific article; zbMATH DE number 956792 (Why is no real title available?)
- Algorithms for Voting and Competitive Location on a Network
- Competitive Location Models: A Framework and Bibliography
- Competitive Location on a Network
- Competitive location on a network
- Defensive Foresight Rather than Minimax: A Comment on Eaton and Lipsey's Model of Spatial Competition
- Equivalence of Solutions to Network Location Problems
- Location of Competing Facilities in a User-Optimizing Environment with Market Externalities
- Locational equilibrium of two facilities on a tree
- New perspectives in competitive location theory
- Note—On a Modified One-Center Model
- On Hierarchical Spatial Competition
- On Hotelling's "Stability in Competition"
- On locating new facilities in a competitive environment
- Product Positioning Under Price Competition
- Reachability of locational Nash equilibria
- The Maximum Capture Problem Including Relocation
- The Maximum Coverage Location Problem
- The role of indifference in sequential models of spatial competition: an example
Cited in
(57)- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane
- Approximation of the competitive facility location problem with MIPs
- Competitive location and pricing on networks with random utilities
- Discrete models for competitive location with foresight
- A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand
- An improved implementation and analysis of the Diaz and O'Rourke algorithm for finding the Simpson point of a convex polygon
- \((r|p)\)-centroid problems on networks with vertex and edge demand
- Competitive facility location and design with reactions of competitors already in the market
- Bilevel competitive facility location and pricing problems
- Planar expropriation problem with non-rigid rectangular facilities
- On Nash equilibria of a competitive location-design problem
- Competitive location models: a review
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane
- Finding all pure strategy Nash equilibria in a planar location game
- Exact method for the capacitated competitive facility location problem
- The discrete facility location problem with balanced allocation of customers
- Sequential competitive location on networks
- A mathematical programming model with equilibrium constraints for competitive closed-loop supply chain network design
- Solving a huff-like competitive location and design model for profit maximization in the plane
- Robust equilibria in location games
- Optimization of competitive facility location for chain stores
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule
- On competitive sequential location in a network with a decreasing demand intensity
- An alternating heuristic for medianoid and centroid problems in the plane
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
- A two-player competitive discrete location model with simultaneous decisions
- Hub location under competition
- The leader-follower location model
- A Stackelberg hub arc location model for a competitive environment
- Static competitive facility location: an overview of optimisation approaches.
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems
- Conditional Location Problems on Networks and in the Plane
- A comparison of formulations and solution methods for the minimum-envy location problem
- Competitive location and pricing on a line with metric transportation costs
- An exact procedure and LP formulations for the leader-follower location problem
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
- A robust model for a leader-follower competitive facility location problem in a discrete space
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models
- Inverse optimization of integer programming games for parameter estimation arising from competitive retail location selection
- GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM
- Strategic design of competing supply chain networks with foresight
- Sequential location models
- Integer programming formulations for three sequential discrete competitive location problems with foresight
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs
- \((r,p)\)-centroid problems on paths and trees
- Sequential location-allocation of public facilities in one- and two- dimensional space: Comparison of several policies
- The \((1 | 1)\)-centroid problem in the plane with distance constraints
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences
- On a branch-and-bound approach for a Huff-like Stackelberg location problem
- A genetic algorithm for the p-median problem with pos/neg weights
- A bilevel competitive location and pricing model with nonuniform split of demand
- Sequential location of two facilities: comparing random to optimal location of the first facility
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios
- A leader-follower game in competitive facility location
- Methods for computing Nash equilibria of a location-quantity game
- Two-player simultaneous location game: preferential rights and overbidding
- Estimating the circle closest to a set of points by maximum likelihood using the BHHH algorithm
This page was built for publication: Sequential location problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278482)
