A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (Q1362973)

From MaRDI portal
Revision as of 17:05, 27 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
scientific article

    Statements

    A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points (English)
    0 references
    0 references
    0 references
    7 August 1997
    0 references
    transshipment-related problem
    0 references
    \(p\)-median location
    0 references
    Lagrangean decomposition
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers