Extreme points of discrete location polyhedra

DOI10.1007/BF02579074zbMath0983.90052OpenAlexW2043795473MaRDI QIDQ5945254

Mercedes Landete, Lázaro Cánovas, Alfredo Marín

Publication date: 10 October 2001

Published in: Top (Search for Journal in Brave)

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

zbMATH Keywords

extreme pointsconvex polyhedradiscrete locationsimple plant location problemtwo level uncapacitated facility location problem

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Cites Work

• Valid inequalities and facets of the capacitated plant location problem
• A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
• The simple plant location problem: Survey and synthesis
• On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• Properties of vertex packing and independence system polyhedra
• On the Two-Level Uncapacitated Facility Location Problem

This page was built for publication: Extreme points of discrete location polyhedra