Fractional vertices, cuts and facets of the simple plant location problem

DOI10.1007/BFb0120893zbMath0439.90061OpenAlexW134612072MaRDI QIDQ3882190

Monique Guignard

Publication date: 1980

Published in: Mathematical Programming Studies (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0120893

zbMATH Keywords

duality gapcutting planesvalid inequalitiesconvex polytopeslogisticsfacetscutsplant location problemdirect dual algorithmfractional verticesstructure of linear programming polytopes

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05) Polytopes and polyhedra (52Bxx)

Related Items

New facets for the two-stage uncapacitated facility location polytope, On the exact solution of large-scale simple plant location problems, The connected facility location 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, 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, 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, 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, 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, Assessment of approximate algorithms: The error measure's crucial role, Capacitated facility location: Separation algorithms and computational experience, Plant location with minimum inventory, The simple plant location problem: Survey and synthesis, On the facets of the simple plant location packing polytope, Some facets of the simple plant location polytope, Location problems