Strong linear programming relaxations for the orienteering problem (Q1328645)

From MaRDI portal
Revision as of 17:04, 22 May 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
Strong linear programming relaxations for the orienteering problem
scientific article

    Statements

    Strong linear programming relaxations for the orienteering problem (English)
    0 references
    0 references
    0 references
    1 March 1995
    0 references
    0 references
    0 references
    0 references
    0 references
    relaxation
    0 references
    routing
    0 references
    orienteering problem
    0 references
    0-1 integer program
    0 references
    NP-hard
    0 references
    upper bounds
    0 references