On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
From MaRDI portal
Publication:3321802
Recommendations
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- Valid inequalities and facets of the capacitated plant location problem
- New facets for the two-stage uncapacitated facility location polytope
- On the facets of the simple plant location packing polytope
- scientific article; zbMATH DE number 4202014
Cited in
(36)- Classical cuts for mixed-integer programming and branch-and-cut
- Polyhedral results for the precedence-constrained knapsack problem
- Capacitated facility location: Separation algorithms and computational experience
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience
- Exact solution of two location problems via branch-and-bound
- A new lifting theorem for vertex packing
- New facets for the two-stage uncapacitated facility location polytope
- On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs
- Location problems
- New variants of the simple plant location problem and applications
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
- Adapting polyhedral properties from facility to hub location problems
- The generalized assignment problem: Valid inequalities and facets
- On the linear relaxation of the \(p\)-median problem
- On the unboundedness of facility layout problems
- New valid inequalities and facets for the simple plant location problem
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- A family of facets for the uncapacitated \(p\)-median polytope
- On the location and \(p\)-median polytopes
- Extreme points of discrete location polyhedra
- A separation algorithm for the simple plant location problem
- On the 0,1 facets of the set covering polytope
- The plant location problem with demand-dependent setup costs and centralized allocation
- On a connection between facility location and perfect graphs
- Approximate and exact merging of knapsack constraints with cover inequalities
- Valid inequalities and facets of the capacitated plant location problem
- A projection method for the uncapacitated facility location problem
- Plant location with minimum inventory
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- A strengthened formulation for the simple plant location problem with order
- LP extreme points and cuts for the fixed-charge network design problem
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- Facets and algorithms for capacitated lot sizing
- On the facets of the simple plant location packing polytope
- New facets for the set packing polytope
- Some facets of the simple plant location polytope
This page was built for publication: On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3321802)
