Pages that link to "Item:Q439407"
From MaRDI portal
The following pages link to Sequential competitive location on networks (Q439407):
Displaying 40 items.
- Solving a location problem of a Stackelberg firm competing with Cournot-Nash firms (Q301071) (← links)
- Product differentiation and entry timing in a continuous time spatial competition model (Q320121) (← links)
- A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
- \((r|p)\)-centroid problems on networks with vertex and edge demand (Q339626) (← links)
- On the complexity of the \((r|p)\)-centroid problem in the plane (Q456933) (← links)
- Fast metaheuristics for the discrete \((r|p)\)-centroid problem (Q463377) (← links)
- Bilevel competitive facility location and pricing problems (Q463381) (← links)
- On competition in a Stackelberg location-design model with deterministic supplier choice (Q512976) (← links)
- On agglomeration in competitive location models (Q512977) (← links)
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem (Q524886) (← links)
- Voting originated social dynamics: quartile analysis of stochastic environment peculiarities (Q828514) (← links)
- An exact method for the discrete \((r|p)\)-centroid problem (Q887194) (← links)
- The probabilistic customer's choice rule with a threshold attraction value: effect on the location of competitive facilities in the plane (Q1628064) (← links)
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Bilevel programming and applications (Q1665319) (← links)
- Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140) (← links)
- Capacity planning with competitive decision-makers: trilevel MILP formulation, degeneracy, and solution approaches (Q1683064) (← links)
- Cournot-Stackelberg games in competitive delocation (Q1699134) (← links)
- A supply chain member should set its margin later if another member's cost is highly uncertain (Q1711455) (← links)
- Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
- Joint pricing and location decisions in a heterogeneous market (Q1753574) (← links)
- The follower competitive location problem with comparison-shopping (Q2005921) (← links)
- Facility dependent distance decay in competitive location (Q2031201) (← links)
- A minimax regret model for the leader-follower facility location problem (Q2070777) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- Competitive location in cognitive radio networks (Q2342922) (← links)
- Two-player simultaneous location game: preferential rights and overbidding (Q2355898) (← links)
- Competitive location and pricing on networks with random utilities (Q2357929) (← links)
- Locating facilities in a competitive environment (Q2359402) (← links)
- Approximating solutions to a bilevel capacitated facility location problem with customer's patronization toward a list of preferences (Q2422923) (← links)
- Robust equilibria in location games (Q2629657) (← links)
- VNS heuristic for the –centroid problem on the plane (Q2840744) (← links)
- Sequential Location Game on Continuous Directional Star Networks (Q3297829) (← links)
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems (Q3458816) (← links)
- A New Scatter Search Design for Multiobjective Combinatorial Optimization with an Application to Facility Location (Q4995091) (← links)
- A Bi-Level Programming Model for Protecting an Important Node in a Network (Q5863185) (← links)
- Nash equilibrium sorting genetic algorithm for simultaneous competitive maximal covering location with multiple players (Q6048218) (← links)
- A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)