Some facets of the simple plant location polytope

DOI10.1007/BF01583779zbMath0485.90069OpenAlexW2019409566MaRDI QIDQ3945954

Cornuéjols, Gérard, Jean-Michel Thizy

Publication date: 1982

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

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

zbMATH Keywords

combinatorial optimizationfacility locationsimple plant location problemfacial structurestable set problemconvex hull of feasible solutionsuncapacitated plant location problemvertex packing problem

Mathematics Subject Classification ID

Integer programming (90C10) Inventory, storage, reservoirs (90B05) Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items

A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem, On the exact solution of large-scale simple plant location problems, Submodularity and valid inequalities in capacitated fixed charge networks, On the 0,1 facets of the set covering polytope, Polyhedral properties of the \(K\)-median problem on a tree, 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, On the \(p\)-median polytope of \(Y\)-free graphs, 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, Facets of the three-index assignment 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, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, Facets and algorithms for capacitated lot sizing, Capacitated facility location: Separation algorithms and computational experience, The simple plant location problem: Survey and synthesis, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, On the facets of the simple plant location packing polytope, Separating lifted odd-hole inequalities to solve the index selection problem, A comparison of two dual-based procedures for solving the p-median problem, Location problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A class of facet producing graphs for vertex packing polyhedra
• On certain polytopes associated with graphs
• On the symmetric travelling salesman problem I: Inequalities
• Selected Families of Location Problems
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• Lifting the facets of zero–one polytopes
• On the symmetric travelling salesman problem: A computational study
• Fractional vertices, cuts and facets of the simple plant location problem
• A restricted Lagrangean approach to the traveling salesman problem
• Vertex packings: Structural properties and algorithms
• Set Partitioning: A survey
• Further facet generating procedures for vertex packing polytopes
• Properties of vertex packing and independence system polyhedra
• On the facial structure of set packing polyhedra
• Paths, Trees, and Flowers
• Blocking and anti-blocking pairs of polyhedra