A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (Q1266514): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(94)00299-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1981245140 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4065051 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Treatment of the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4744064 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Linear-Programming, Combinatorial Approach to the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Approach to Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3701213 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3693290 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time dependency in multiple objective dynamic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3206662 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time Dependent Vehicle Routing Problems: Formulations, Properties and Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length / rank
 
Normal rank

Latest revision as of 15:34, 28 May 2024

scientific article
Language Label Description Also known as
English
A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
scientific article

    Statements

    A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem (English)
    0 references
    0 references
    0 references
    7 October 1998
    0 references
    heuristics
    0 references
    routing
    0 references
    transportation
    0 references
    time dependence
    0 references
    traveling salesman
    0 references
    precedence relationships
    0 references

    Identifiers