On the facets of the simple plant location packing polytope
From MaRDI portal
Publication:1850113
DOI10.1016/S0166-218X(01)00328-6zbMath1175.90326MaRDI QIDQ1850113
Alfredo Marín, Lázaro Cánovas, Mercedes Landete
Publication date: 2 December 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Strengthening the reliability fixed-charge location model using clique constraints, Discrete location for bundled demand points, New variants of the simple plant location problem and applications, On the linear relaxation of the \(p\)-median problem, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, On the Location and p-Median Polytopes, 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, On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem, Adapting polyhedral properties from facility to hub location problems, Stochastic set packing problem, The double-assignment plant location problem with co-location, On a connection between facility location and perfect graphs, A separation algorithm for the simple plant location problem, A flexible model and efficient solution strategies for discrete location problems, A new lifting theorem for vertex packing
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Valid inequalities and separation for uncapacitated fixed charge networks
- Valid inequalities and facets of the capacitated plant location problem
- Capacitated facility location: Separation algorithms and computational experience
- Wheel inequalities for stable set polytopes
- On certain polytopes associated with graphs
- On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Valid Linear Inequalities for Fixed Charge Problems
- Fractional vertices, cuts and facets of the simple plant location problem
- Some facets of the simple plant location polytope
- Technical Note—A Note on Zero-One Programming
- Facet Obtaining Procedures for Set Packing Problems
- Properties of vertex packing and independence system polyhedra
- Capacitated Facility Location: Valid Inequalities and Facets
- On the facial structure of set packing polyhedra
- New facets for the set packing polytope
- A family of facets for the uncapacitated \(p\)-median polytope
