Pages that link to "Item:Q1949680"
From MaRDI portal
The following pages link to Polyhedral study of simple plant location problem with order (Q1949680):
Displaying 12 items.
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem (Q1652079) (← links)
- Approximation of the competitive facility location problem with MIPs (Q1725607) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario (Q2308185) (← links)
- A strengthened formulation for the simple plant location problem with order (Q2643785) (← links)
- Location with preferences (Q2895186) (← links)
- A Cut Generation Algorithm of Finding an Optimal Solution in a Market Competition (Q4973247) (← links)
- Discrete facility location in machine learning (Q5100135) (← links)
- Dynamically second-preferred \(p\)-center problem (Q6106963) (← links)
- The multilevel facility location and pricing problems: the computational complexity and the stability analysis (Q6110625) (← links)
