A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737): Difference between revisions

The authors give a heuristic algorithm including computational results for the following problem: \[ \min z=\sum_ i\sum_ j\sum_ k c_{ijk} x_{ijk}+\sum_ j\sum_ k f_{jk} y_{jk}, \] subject to \(\sum_ j x_{ijk}=1\) for all \(i,k\); \(\sum_ j x_{jjk}=p_ k\) for all \(k\); \(x_{ijk}\leq x_{jjk}\) for all \(i,j,k\), \(i\neq j\); \(y_{jk}- x_{jjk}+x_{jj(k-1)}\geq 0\) for all \(j,k\); \(x_{ijk}, y_{jk}\in\{0,1\}\) for all \(i,j,k\).