The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (Q1848594)

From MaRDI portal
Revision as of 18:24, 4 June 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
scientific article

    Statements

    The transportation problem with exclusionary side constraints and two branch-and-bound algorithms (English)
    0 references
    0 references
    13 November 2002
    0 references
    0 references
    0 references
    0 references
    0 references
    network flows
    0 references
    integer programming
    0 references
    transportation
    0 references
    branch-and-bound
    0 references
    logistics
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references