Capacitated Facility Location: Valid Inequalities and Facets
From MaRDI portal
Publication:4864872
DOI10.1287/moor.20.3.562zbMath0846.90088OpenAlexW2059019391MaRDI 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
Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Combinatorial optimization (90C27) Discrete location and assignment (90B80)
Related Items
The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design, Integrality gaps for strengthened linear relaxations of capacitated facility location, A cutting plane algorithm for the capacitated facility location problem, Polyhedral analysis for concentrator location problems, On solving large instances of the capacitated facility location problem, A cutting plane algorithm for the capacitated connected facility location problem, A branch-and-price algorithm for the capacitated facility location problem, Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set, Discrete equal-capacityp-median problem, Primal-Dual Schema for Capacitated Covering Problems, A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation, Container shipping service selection and cargo routing with transshipment limits, LP-Based Algorithms for Capacitated Facility Location, Valid inequalities for the single arc design problem with set-ups, Supermodular covering knapsack polytope, Cutting planes in integer and mixed integer programming, A branch and cut algorithm for hub location problems with single assignment, A Lagrangean heuristic for the plant location problem with multiple facilities in the same site, A family of facets for the uncapacitated \(p\)-median polytope, Integrated design and operation of remnant inventory supply chains under uncertainty, Flow pack facets of the single node fixed-charge flow polytope, Weak flow cover inequalities for the capacitated facility location problem, Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design, Primal-dual schema for capacitated covering problems, Polyhedral techniques in combinatorial optimization I: Theory, Capacitated facility location: Separation algorithms and computational experience, An effective heuristic for large-scale capacitated facility location problems, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, On the facets of the simple plant location packing polytope, New modeling approaches for the design of local access transport area networks
