A branch-and-cut algorithm for the balanced traveling salesman problem (Q6123381)

From MaRDI portal
Revision as of 22:34, 26 August 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129042105, #quickstatements; #temporary_batch_1724706784888)
scientific article; zbMATH DE number 7812583
Language Label Description Also known as
English
A branch-and-cut algorithm for the balanced traveling salesman problem
scientific article; zbMATH DE number 7812583

    Statements

    A branch-and-cut algorithm for the balanced traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    4 March 2024
    0 references
    traveling salesman problem
    0 references
    balanced optimization
    0 references
    mixed-integer programming
    0 references
    branch-and-cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references