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

From MaRDI portal
Revision as of 09:50, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Langrangean heuristic for the \(p_ k\)-median dynamic location problem
scientific article

    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references