Pages that link to "Item:Q336436"
From MaRDI portal
The following pages link to Branch-and-bound algorithm for a competitive facility location problem (Q336436):
Displaying 20 items.
- A local search heuristic for the \((r| p)\)-centroid problem in the plane (Q337239) (← links)
- On the competitive facility location problem with a free choice of suppliers (Q463373) (← links)
- A variational inequality formulation for designing a multi-echelon, multi-product supply chain network in a competitive environment (Q1639276) (← links)
- Exact method for the capacitated competitive facility location problem (Q1652629) (← links)
- Cut generation algorithm for the discrete competitive facility location problem (Q1673703) (← links)
- Cournot-Stackelberg games in competitive delocation (Q1699134) (← links)
- Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- Locating facilities in a competitive environment (Q2359402) (← links)
- Competitive facility location problem with foresight considering discrete-nature attractiveness for facilities: model and solution (Q2676299) (← links)
- A study on the use of heuristics to solve a bilevel programming problem (Q2806437) (← links)
- A capacitated competitive facility location problem (Q3186853) (← links)
- Quantum binary particle swarm optimization-based algorithm for solving a class of bi-level competitive facility location problems (Q3458816) (← 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)
- Competitive Facility Location with Selfish Users and Queues (Q5126616) (← links)
- Computational complexity of the discrete competitive facility location problem (Q5264752) (← links)
- Discrete Competitive Facility Location: Modeling and Optimization Approaches (Q5270511) (← links)
- An upper bound for the competitive location and capacity choice problem with multiple demand scenarios (Q5374006) (← links)
- (Q5878622) (← links)