Capacitated Facility Location: Valid Inequalities and Facets

DOI10.1287/moor.20.3.562zbMath0846.90088MaRDI QIDQ4864872

Yves Pochet, Laurence A. Wolsey, Karen Aardal

Publication date: 25 February 1996

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://pure.uvt.nl/portal/en/publications/capacitated-facility-location(a9bde4d2-d355-466b-80d8-d7296128ed47).html

zbMATH Keywords

capacitated facility location; polyhedral structure; convex hull of feasible solutions

Mathematics Subject Classification ID

52B12: Special polytopes (linear programming, centrally symmetric, etc.)

90C10: Integer programming

90C27: Combinatorial optimization

90B80: Discrete location and assignment

Related Items

A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, Polyhedral techniques in combinatorial optimization I: Theory, Unnamed Item, A family of facets for the uncapacitated \(p\)-median polytope, Flow pack facets of the single node fixed-charge flow polytope, Cutting planes in integer and mixed integer programming, Polyhedral analysis for concentrator location problems, On solving large instances of the capacitated facility location problem, A branch-and-price algorithm for the capacitated facility location problem, Capacitated facility location: Separation algorithms and computational experience, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, New modeling approaches for the design of local access transport area networks, A branch and cut algorithm for hub location problems with single assignment, On the facets of the simple plant location packing polytope, Primal-Dual Schema for Capacitated Covering Problems