Pages that link to "Item:Q1850113"
From MaRDI portal
The following pages link to On the facets of the simple plant location packing polytope (Q1850113):
Displaying 22 items.
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- On the linear relaxation of the \(p\)-median problem (Q429694) (← links)
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem (Q434153) (← links)
- On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem (Q522273) (← links)
- Discrete location for bundled demand points (Q611011) (← links)
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Stochastic set packing problem (Q713096) (← links)
- A flexible model and efficient solution strategies for discrete location problems (Q1028444) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- On the Boolean-quadric packing uncapacitated facility-location polytope (Q1273120) (← links)
- Facets for node packing (Q1278997) (← 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)
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs (Q1751184) (← links)
- On a connection between facility location and perfect graphs (Q1785286) (← links)
- Polyhedral study of simple plant location problem with order (Q1949680) (← links)
- The double-assignment plant location problem with co-location (Q2026959) (← links)
- A separation algorithm for the simple plant location problem (Q2060615) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- On the Location and p-Median Polytopes (Q2971602) (← links)
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems (Q3321802) (← links)
- New variants of the simple plant location problem and applications (Q6106762) (← links)