Pages that link to "Item:Q1681140"
From MaRDI portal
The following pages link to Integer programming formulations for three sequential discrete competitive location problems with foresight (Q1681140):
Displayed 10 items.
- Effects of multipurpose shopping trips on retail store location in a duopoly (Q1750496) (← links)
- Branch-and-cut approach based on generalized Benders decomposition for facility location with limited choice rule (Q2030506) (← links)
- A minimax regret model for the leader-follower facility location problem (Q2070777) (← links)
- Robust model for discrete competitive facility location problem with the uncertainty of customer behaviors (Q2228392) (← links)
- Competitive location and pricing on a line with metric transportation costs (Q2282503) (← links)
- Exact methods for the discrete multiple allocation \((r|p)\) hub-centroid problem (Q2289952) (← links)
- Generalized Benders decomposition for competitive facility location with concave demand and zone-specialized variable attractiveness (Q2668664) (← links)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- Sequential Location Game on Continuous Directional Star Networks (Q3297829) (← links)
- A kernel search matheuristic to solve the discrete leader-follower location problem (Q6195396) (← links)