On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
From MaRDI portal
Publication:3321801
DOI10.1287/moor.8.4.579zbMath0536.90029OpenAlexW2150915074MaRDI QIDQ3321801
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-00076475/file/RR-0086.pdf
Related Items
On the p-median polytope of fork-free graphs, A strengthened formulation for the simple plant location problem with order, New facets for the two-stage uncapacitated facility location polytope, Polyhedral properties of the \(K\)-median problem on a tree, Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta, In-out algorithm for assortment planning under a ranking-based consumer choice model, 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, The generalized assignment problem: Valid inequalities and facets, On the Location and p-Median Polytopes, Chvátal closures for mixed integer programming problems, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Classical cuts for mixed-integer programming and branch-and-cut, 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, Facility location models for distribution system design, Extreme points of discrete location polyhedra, A family of facets for the uncapacitated \(p\)-median polytope, The double-assignment plant location problem with co-location, On a connection between facility location and perfect graphs, Weak flow cover inequalities for the capacitated facility location problem, 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, Exact Solution of Two Location Problems via Branch-and-Bound, On the facets of the simple plant location packing polytope, Separating lifted odd-hole inequalities to solve the index selection problem, Some facets of the simple plant location polytope, Location problems, A comparison of heuristics and relaxations for the capacitated plant location problem, Uncapacitated Euclidean hub location: strengthened formulation, new facets and a relax-and-cut algorithm
