A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem
From MaRDI portal
Publication:2339828
DOI10.1016/j.disopt.2014.06.001zbMath1308.90087OpenAlexW1982164904MaRDI QIDQ2339828
Publication date: 9 April 2015
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2014.06.001
Programming involving graphs or networks (90C35) Dynamic programming (90C39) Discrete location and assignment (90B80)
Cites Work
This page was built for publication: A polynomial algorithm for the two-connections variant of the tree \(p\)-median problem