AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (Q5315817): 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: TSPLIB / rank
 
Normal rank

Revision as of 23:05, 28 February 2024

scientific article; zbMATH DE number 2204128
Language Label Description Also known as
English
AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES
scientific article; zbMATH DE number 2204128

    Statements

    AN INTEGER L-SHAPED ALGORITHM FOR TIME-CONSTRAINED TRAVELING SALESMAN PROBLEM WITH STOCHASTIC TRAVEL AND SERVICE TIMES (English)
    0 references
    0 references
    0 references
    0 references
    9 September 2005
    0 references
    0 references
    0 references
    0 references
    0 references
    Integer L-shaped method
    0 references
    time-constrained traveling salesman problem
    0 references
    stochastic program with recourse
    0 references
    Benders' decomposition
    0 references