A revisited branch-and-cut algorithm for large-scale orienteering problems (Q6087525)

From MaRDI portal
Revision as of 14:04, 3 August 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 7765851
Language Label Description Also known as
English
A revisited branch-and-cut algorithm for large-scale orienteering problems
scientific article; zbMATH DE number 7765851

    Statements

    A revisited branch-and-cut algorithm for large-scale orienteering problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    15 November 2023
    0 references
    routing
    0 references
    orienteering problem
    0 references
    branch-and-cut
    0 references
    large problems
    0 references
    0 references

    Identifiers