An integer programming approach for the time-dependent traveling salesman problem with time windows (Q1651554): 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/j.cor.2017.06.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2733776472 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time dependent traveling salesman problem: polyhedra and algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation / 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: The precedence-constrained asymmetric traveling salesman polytope / 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: The Delivery Man Problem and Cumulative Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved rolling horizon approaches to the aircraft sequencing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-dependent routing problems: a review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Natural and extended formulations for the time-dependent traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A classification of formulations for the (time-dependent) traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modelling Intra-City Time-Dependent Travel Speeds for Vehicle Scheduling Problems / 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: Time‐dependent traveling salesman problem–the deliveryman case / 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 Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing an efficient minimum capacity cut algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle Routing / rank
 
Normal rank

Latest revision as of 03:43, 16 July 2024

scientific article
Language Label Description Also known as
English
An integer programming approach for the time-dependent traveling salesman problem with time windows
scientific article

    Statements

    An integer programming approach for the time-dependent traveling salesman problem with time windows (English)
    0 references
    0 references
    0 references
    12 July 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    time-dependent TSP
    0 references
    time windows
    0 references
    integer linear programming
    0 references
    branch-and-cut
    0 references
    0 references
    0 references