Unbalanced, capacitated p‐median problems on a chain graph with a continuum of link demands
DOI10.1002/NET.3230210202zbMATH Open0725.90049OpenAlexW1986958708MaRDI QIDQ5202829FDOQ5202829
Thomas P. Rizzo, Hanif D. Sherali
Publication date: 1991
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230210202
Recommendations
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
- A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
- Capacitated, balanced, sequential location-allocation problems on chains and trees
- Network Median Problems with Continuously Distributed Demand
networktree networkfirst-order optimality conditionschain networkcontinuous demand density functionovercapacitated location- allocation problem
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)
Cites Work
Cited In (6)
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Capacitated location allocation problem with stochastic location and fuzzy demand: a hybrid algorithm
- Capacitated, balanced, sequential location-allocation problems on chains and trees
- Network location problems with continuous link demands: p-medians on a chain and 2-medians on a tree
- Discrete equal-capacityp-median problem
- A Capacitated, Balanced, 2-Median Problem on a Tree Network with a Continuum of Link Demands
This page was built for publication: Unbalanced, capacitated p‐median problems on a chain graph with a continuum of link demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5202829)