Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Changed an Item
Property / describes a project that uses
 
Property / describes a project that uses: CVRPSP / rank
 
Normal rank

Revision as of 21:48, 29 February 2024

scientific article
Language Label Description Also known as
English
Facets and valid inequalities for the time-dependent travelling salesman problem
scientific article

    Statements

    Facets and valid inequalities for the time-dependent travelling salesman problem (English)
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    time-dependent TSP
    0 references
    branch and cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references