Pages that link to "Item:Q526408"
From MaRDI portal
The following pages link to Improving solution of discrete competitive facility location problems (Q526408):
Displaying 16 items.
- A hybrid genetic algorithm with solution archive for the discrete \((r|p)\)-centroid problem (Q524886) (← links)
- The discrete facility location problem with balanced allocation of customers (Q631097) (← links)
- Exact approaches for competitive facility location with discrete attractiveness (Q828655) (← links)
- New heuristic algorithms for discrete competitive location problems with binary and partially binary customer behavior (Q1652139) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← 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)
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm (Q2460125) (← links)
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness (Q2668664) (← links)
- (Q3117186) (← links)
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems (Q3458816) (← links)
- (Q4391580) (← links)
- Modeling Discrete Competitive Facility Location (Q5265972) (← 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)
- Population-based algorithm for discrete facility location with ranking of candidate locations (Q6653555) (← links)
