Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (Q5060801): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An enhanced lower bound for the time-dependent travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polyhedral study of the asymmetric traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time Bucket Formulation for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle dispatching with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear edge costs and labeling algorithms: The case of the time‐dependent vehicle routing problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for the time-dependent traveling salesman problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows Part II: Genetic Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent capacitated profitable tour problem with time windows and precedence constraints / rank
 
Normal rank

Revision as of 06:40, 31 July 2024

scientific article; zbMATH DE number 7640794
Language Label Description Also known as
English
Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows
scientific article; zbMATH DE number 7640794

    Statements

    Dynamic Programming for the Time-Dependent Traveling Salesman Problem with Time Windows (English)
    0 references
    11 January 2023
    0 references
    traveling salesman problem
    0 references
    time-dependent travel times
    0 references
    time windows
    0 references
    dynamic programming
    0 references
    state-space relaxation
    0 references
    completion bounds
    0 references

    Identifiers