Pages that link to "Item:Q1725607"
From MaRDI portal
The following pages link to Approximation of the competitive facility location problem with MIPs (Q1725607):
Displaying 10 items.
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Cut generation algorithm for the discrete competitive facility location problem (Q1673703) (← links)
- A mixed-integer bilevel programming approach for a competitive prioritized set covering problem (Q1751159) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition (Q4973247) (← links)
- Bilevel Optimization: Theory, Algorithms, Applications and a Bibliography (Q5014642) (← links)
- Computing an upper bound in the two-stage bi-level competitive location model (Q5878622) (← links)
- Upper bound for the competitive facility location problem with demand uncertainty (Q6194427) (← links)
- Additional constraints for dynamic competitive facility location problem (Q6644068) (← links)
