Discrete equal-capacityp-median problem

DOI10.1002/(SICI)1520-6750(200003)47:2%3C166::AID-NAV6%3E3.0.CO;2-WMaRDI QIDQ4949164zbMATH OpenOpenAlexFDO

Authors 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%3C166::aid-nav6%3E3.0.co;2-w

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Recommendations

• Capacitated facility location/network design problems.
• An efficient heuristic algorithm for the capacitated \(p\)-median problem
• Two exact algorithms for the capacitated p-median problem
• Solution methods for thep-median problem: An annotated bibliography
• A branch‐and‐price algorithm for the capacitated p‐median problem

Cites work

• A branch‐bound algorithm for the capacitated facilities location problem
• A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
• A dual ascent approach to the fixed-charge capacitated network design problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Capacitated Facility Location: Valid Inequalities and Facets
• 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
• Heuristics for the capacitated plant location model
• scientific article; zbMATH DE number 47262 (Why is no real title available?)
• Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The Boolean quadratic polytope: Some characteristics, facets and relatives
• Unbalanced, capacitated p‐median problems on a chain graph with a continuum of link demands
• Valid inequalities and facets of the capacitated plant location problem
• Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems
• Valid Linear Inequalities for Fixed Charge Problems

Cited in

(4)

• Discretized formulations for capacitated location problems with modular distribution costs
• A comparative study of different formulations for the capacitated discrete ordered median problem
• A family of facets for the uncapacitated \(p\)-median polytope
• Formulations and valid inequalities for the capacitated dispersion problem

This page was built for publication: Discrete equal-capacityp-median problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4949164)