A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (Q1194737)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Langrangean heuristic for the \(p_ k\)-median dynamic location problem |
scientific article; zbMATH DE number 68476
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Langrangean heuristic for the \(p_ k\)-median dynamic location problem |
scientific article; zbMATH DE number 68476 |
Statements
A Langrangean heuristic for the \(p_ k\)-median dynamic location problem (English)
0 references
6 October 1992
0 references
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\).
0 references
location problem
0 references
heuristic algorithm
0 references