Pages that link to "Item:Q1652139"
From MaRDI portal
The following pages link to New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior (Q1652139):
Displaying 15 items.
- Models and algorithms for competitive facility location problems with different customer behavior (Q276530) (← links)
- Improving solution of discrete competitive facility location problems (Q526408) (← links)
- Efficient simulated annealing based solution approaches to the competitive single and multiple allocation hub location problems (Q1652521) (← 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)
- Location-based pricing and channel selection in a supply chain: a case study from the food retail industry (Q2196108) (← links)
- Exact and heuristic solutions of a discrete competitive location model with Pareto-Huff customer choice rule (Q2222142) (← links)
- Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors (Q2228392) (← links)
- A continuum perspective of customer choice rules for competitive facility location problems (Q2698583) (← links)
- A discrete competitive facility location model with proportional and binary rules sequentially applied (Q6043105) (← links)
- Competitive network restructuring with spatially loyal customers. A bilevel facility delocation problem (Q6065606) (← links)
- Sequential customers' decisions in facility location with comparison-shopping (Q6065653) (← links)
- Multipurpose shopping trips and location (Q6099398) (← links)
- Robust model of discrete competitive facility location problem with partially proportional rule (Q6534783) (← links)
- Population-based algorithm for discrete facility location with ranking of candidate locations (Q6653555) (← links)
