The median tour and maximal covering tour problems: Formulations and heuristics (Q1328602)

From MaRDI portal
Revision as of 16:03, 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
The median tour and maximal covering tour problems: Formulations and heuristics
scientific article

    Statements

    The median tour and maximal covering tour problems: Formulations and heuristics (English)
    0 references
    0 references
    0 references
    19 February 1995
    0 references
    bicriterion routing problems
    0 references
    median tour problem
    0 references
    maximal covering tour problem
    0 references
    NP-hard
    0 references
    heuristic procedure
    0 references
    realistically scaled problem
    0 references
    distributed computer networks
    0 references

    Identifiers