Fractional vertices, cuts and facets of the simple plant location problem
From MaRDI portal
Publication:3882190
DOI10.1007/BFb0120893zbMath0439.90061MaRDI QIDQ3882190
Publication date: 1980
Published in: Mathematical Programming Studies (Search for Journal in Brave)
duality gap; cutting planes; valid inequalities; convex polytopes; logistics; facets; cuts; plant location problem; direct dual algorithm; fractional vertices; structure of linear programming polytopes
Related Items
Extreme points of discrete location polyhedra, A family of facets for the uncapacitated \(p\)-median polytope, Adapting polyhedral properties from facility to hub location problems, Facility location models for distribution system design, A projection method for the uncapacitated facility location problem, Location problems, On the exact solution of large-scale simple plant location problems, Valid inequalities and facets of the capacitated plant location problem, Capacitated facility location: Separation algorithms and computational experience, Plant location with minimum inventory, A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, Assessment of approximate algorithms: The error measure's crucial role, The simple plant location problem: Survey and synthesis, On the facets of the simple plant location packing polytope, LP extreme points and cuts for the fixed-charge network design problem, Some facets of the simple plant location polytope
