The following pages link to Sequential location problems (Q1278482):
Displayed 50 items.
- Hub location under competition (Q322435) (← links)
- A Stackelberg hub arc location model for a competitive environment (Q337007) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- A robust model for a leader-follower competitive facility location problem in a discrete space (Q345745) (← links)
- Sequential competitive location on networks (Q439407) (← links)
- Competitive facility location and design with reactions of competitors already in the market (Q439603) (← links)
- Bilevel competitive facility location and pricing problems (Q463381) (← links)
- Sequential location of two facilities: comparing random to optimal location of the first facility (Q512975) (← links)
- Strategic design of competing supply chain networks with foresight (Q532462) (← links)
- On Nash equilibria of a competitive location-design problem (Q541712) (← links)
- An exact procedure and LP formulations for the leader-follower location problem (Q611000) (← links)
- A two-player competitive discrete location model with simultaneous decisions (Q613464) (← links)
- The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
- Planar expropriation problem with non-rigid rectangular facilities (Q709112) (← links)
- Estimating the circle closest to a set of points by maximum likelihood using the BHHH algorithm (Q818084) (← links)
- Solving a huff-like competitive location and design model for profit maximization in the plane (Q864047) (← links)
- A genetic algorithm for the \(p\)-median problem with pos/neg weights (Q865554) (← links)
- The leader-follower location model (Q883197) (← links)
- Sequential versus simultaneous approach in the location and design of two new facilities using planar Huff-like models (Q960385) (← links)
- On competitive sequential location in a network with a decreasing demand intensity (Q976444) (← links)
- A comparison of formulations and solution methods for the minimum-envy location problem (Q1000990) (← links)
- Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree (Q1026238) (← links)
- On a branch-and-bound approach for a Huff-like Stackelberg location problem (Q1027988) (← links)
- On the impact of spatial pattern, aggregation, and model parameters in planar Huff-type competitive location and design problems (Q1027999) (← links)
- \((r,p)\)-centroid problems on paths and trees (Q1034634) (← links)
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane (Q1628064) (← links)
- A planar single-facility competitive location and design problem under the multi-deterministic choice rule (Q1652088) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
- Optimization of competitive facility location for chain stores (Q1730656) (← links)
- A leader-follower game in competitive facility location (Q1761992) (← links)
- An alternating heuristic for medianoid and centroid problems in the plane (Q1870807) (← links)
- Heuristics for the facility location and design \((1|1)\)-centroid problem on the plane (Q2268924) (← links)
- Finding all pure strategy Nash equilibria in a planar location game (Q2275630) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- Two-player simultaneous location game: preferential rights and overbidding (Q2355898) (← links)
- Competitive location and pricing on networks with random utilities (Q2357929) (← links)
- Improved algorithms for some competitive location centroid problems on paths, trees and graphs (Q2375952) (← links)
- A two-level evolutionary algorithm for solving the facility location and design \((1|1)\)-centroid problem on the plane with variable demand (Q2392125) (← links)
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
- Discrete models for competitive location with foresight (Q2456629) (← links)
- Methods for computing Nash equilibria of a location-quantity game (Q2482381) (← links)
- Robust equilibria in location games (Q2629657) (← links)
- The (1|1)-Centroid Problem in the Plane with Distance Constraints (Q3177899) (← links)
- GENETIC ALGORITHM SOLUTION FOR MULTI-PERIOD TWO-ECHELON INTEGRATED COMPETITIVE/UNCOMPETITIVE FACILITY LOCATION PROBLEM (Q3521608) (← links)
- A Mathematical Programming Model with Equilibrium Constraints for Competitive Closed-Loop Supply Chain Network Design (Q4595327) (← links)
- (Q4944234) (← links)
- A Bilevel Competitive Location and Pricing Model with Nonuniform Split of Demand (Q4973258) (← links)
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios (Q5374006) (← links)