On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
From MaRDI portal
Publication:3321802
DOI10.1287/moor.8.4.590zbMath0536.90030OpenAlexW2013210975MaRDI QIDQ3321802
No author found.
Publication date: 1983
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/inria-00076474/file/RR-0087.pdf
Related Items (33)
A strengthened formulation for the simple plant location problem with order ⋮ The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation ⋮ On the 0,1 facets of the set covering polytope ⋮ New variants of the simple plant location problem and applications ⋮ LP extreme points and cuts for the fixed-charge network design problem ⋮ On the linear relaxation of the \(p\)-median problem ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ The generalized assignment problem: Valid inequalities and facets ⋮ On the Location and p-Median Polytopes ⋮ A projection method for the uncapacitated facility location problem ⋮ Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience ⋮ Classical cuts for mixed-integer programming and branch-and-cut ⋮ Approximate and exact merging of knapsack constraints with cover inequalities ⋮ New valid inequalities and facets for the simple plant location problem ⋮ On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs ⋮ New facets for the set packing polytope ⋮ Polyhedral results for the precedence-constrained knapsack problem ⋮ Adapting polyhedral properties from facility to hub location problems ⋮ Extreme points of discrete location polyhedra ⋮ A family of facets for the uncapacitated \(p\)-median polytope ⋮ On a connection between facility location and perfect graphs ⋮ The plant location problem with demand-dependent setup costs and centralized allocation ⋮ Valid inequalities and facets of the capacitated plant location problem ⋮ A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem ⋮ A separation algorithm for the simple plant location problem ⋮ Facets and algorithms for capacitated lot sizing ⋮ Capacitated facility location: Separation algorithms and computational experience ⋮ Plant location with minimum inventory ⋮ A new lifting theorem for vertex packing ⋮ Exact Solution of Two Location Problems via Branch-and-Bound ⋮ On the facets of the simple plant location packing polytope ⋮ Some facets of the simple plant location polytope ⋮ Location problems
This page was built for publication: On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
