Pages that link to "Item:Q3882190"
From MaRDI portal
The following pages link to Fractional vertices, cuts and facets of the simple plant location problem (Q3882190):
Displayed 16 items.
- Adapting polyhedral properties from facility to hub location problems (Q705504) (← links)
- Facility location models for distribution system design (Q707128) (← links)
- A projection method for the uncapacitated facility location problem (Q918404) (← links)
- Location problems (Q1062596) (← links)
- On the exact solution of large-scale simple plant location problems (Q1121152) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← links)
- Plant location with minimum inventory (Q1290654) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- Assessment of approximate algorithms: The error measure's crucial role (Q1820671) (← links)
- The simple plant location problem: Survey and synthesis (Q1837098) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- LP extreme points and cuts for the fixed-charge network design problem (Q3778564) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Extreme points of discrete location polyhedra (Q5945254) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)