Discrete equal-capacityp-median problem

DOI<166::AID-NAV6>3.0.CO;2-W 10.1002/(SICI)1520-6750(200003)47:2<166::AID-NAV6>3.0.CO;2-WzbMath0973.90045OpenAlexW181060079MaRDI QIDQ4949164

Hanif D. Sherali, Taehyung Park

Publication date: 27 April 2000

Full work available at URL: https://doi.org/10.1002/(sici)1520-6750(200003)47:2<166::aid-nav6>3.0.co;2-w

zbMATH Keywords

location-allocation problemcapacitated facility location problemequal-capacity \(p\)-median problemreformulation-linearizatio technique (RLT)

Mathematics Subject Classification ID

Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items

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

Cites Work

• Unnamed Item
• Heuristics for the capacitated plant location model
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Valid inequalities and facets of the capacitated plant location problem
• A dual ascent approach to the fixed-charge capacitated network design problem
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Capacitated, balanced, sequential location-allocation problems on chains and trees
• Exploiting Special Structures in Constructing a Hierarchy of Relaxations for 0-1 Mixed Integer Problems
• Valid Linear Inequalities for Fixed Charge Problems
• A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
• A Dual-Based Procedure for Uncapacitated Facility Location
• Capacitated Facility Location: Valid Inequalities and Facets
• Unbalanced, capacitated p‐median problems on a chain graph with a continuum of link demands
• A branch‐bound algorithm for the capacitated facilities location problem
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph