Pages that link to "Item:Q276530"
From MaRDI portal
The following pages link to Models and algorithms for competitive facility location problems with different customer behavior (Q276530):
Displaying 12 items.
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior (Q1652139) (← links)
- Competitive facility location problem. An algorithm for the problem concerning the existence of multi-type customers (Q1769122) (← links)
- The follower competitive location problem with comparison-shopping (Q2005921) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- Store location with multipurpose shopping trips and a new random utility customers' choice model (Q2098041) (← links)
- Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors (Q2228392) (← 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)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- Metaheuristics for bilevel optimization: a comprehensive review (Q6065604) (← links)
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
- A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)
- Robust model of discrete competitive facility location problem with partially proportional rule (Q6534783) (← links)
