On the facets of the simple plant location packing polytope
type: Item
instance of: scholarly article
title: On the facets of the simple plant location packing polytope
zbMATH Open document ID: 1175.90326
DOI: 10.1016/S0166-218X(01)00328-6
author: Lázaro Cánovas
author: Mercedes Landete
author: Alfredo Marín
published in: Discrete Applied Mathematics
publication date: 2002-12-02T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1839078
zbMATH Keywords: Discrete location
zbMATH Keywords: Set packing
zbMATH Keywords: Facet
MaRDI profile type: Publication
cites work: Capacitated facility location: Separation algorithms and computational experience
cites work: Capacitated Facility Location: Valid Inequalities and Facets
cites work: Q3892882
cites work: Facet Obtaining Procedures for Set Packing Problems
cites work: New facets for the set packing polytope
cites work: Wheel inequalities for stable set polytopes
cites work: On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
cites work: On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
cites work: On certain polytopes associated with graphs
cites work: Q4132252
cites work: Q3351135
cites work: Some facets of the simple plant location polytope
cites work: A family of facets for the uncapacitated \(p\)-median polytope
cites work: Q4198056
cites work: Fractional vertices, cuts and facets of the simple plant location problem
cites work: Valid inequalities and facets of the capacitated plant location problem
cites work: Q3993417
cites work: Properties of vertex packing and independence system polyhedra
cites work: Valid Linear Inequalities for Fixed Charge Problems
cites work: On the facial structure of set packing polyhedra
cites work: Technical Note—A Note on Zero-One Programming
cites work: Q4182528
cites work: Valid inequalities and separation for uncapacitated fixed charge networks
description: scientific article; zbMATH DE number 1839078