A family of facets for the uncapacitated \(p\)-median polytope

DOI10.1016/S0167-6377(01)00062-1zbMath0992.90081OpenAlexW2146592084WikidataQ127244706 ScholiaQ127244706MaRDI QIDQ5945384

Ismael Regis jun. de Farias

Publication date: 10 October 2001

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0167-6377(01)00062-1

zbMATH Keywords

facility locationbranch-and-cutcardinality constrained programmingmixed-integer programminguncapacited \(p\)-median polytope

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Related Items (9)

On the p-median polytope of fork-free graphs ⋮ Solving the \(p\)-median problem with a semi-Lagrangian relaxation ⋮ A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem ⋮ On the linear relaxation of the \(p\)-median problem ⋮ On the Location and p-Median Polytopes ⋮ On the \(p\)-median polytope and the directed odd cycle inequalities: triangle-free oriented graphs ⋮ A large class of facets for the \(K\)-median polytope ⋮ On cutting planes for cardinality-constrained linear programs ⋮ On the facets of the simple plant location packing polytope

Uses Software

• OR-Library
• MINTO

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on solving large p-median problems
• Valid inequalities and separation for uncapacitated fixed charge networks
• A tree search algorithm for the p-median problem
• Valid inequalities and facets of the capacitated plant location problem
• Capacitated facility location: Separation algorithms and computational experience
• MINTO, a Mixed INTeger Optimizer
• 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
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Locating replicas of a database on a network
• Capacitated Facility Location: Valid Inequalities and Facets
• Discrete equal-capacityp-median problem
• Technical Note—A Branch-and-Bound Algorithm for Seeking the P-Median
• On the \(p\)-median polytope

This page was built for publication: A family of facets for the uncapacitated \(p\)-median polytope