A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (Q2815467)

From MaRDI portal
Revision as of 09:52, 17 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem
scientific article

    Statements

    A Generic Branch-and-Cut Algorithm for Multiobjective Optimization Problems: Application to the Multilabel Traveling Salesman Problem (English)
    0 references
    0 references
    0 references
    0 references
    29 June 2016
    0 references
    decision analysis
    0 references
    multiple criteria
    0 references
    programming
    0 references
    integer
    0 references
    algorithm
    0 references
    cutting plane
    0 references
    networks-graphs
    0 references
    traveling salesman
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references