An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (Q2482754): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
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: The Directed Rural Postman Problem with Turn Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of the generalized routing problem through graph transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of large-scale, asymmetric traveling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 750: CDT / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rural Postman Problem on mixed graphs with turn penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: The mixed general routing polyhedron / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Results on the Mixed General Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Shortest Path Problem with Time Windows and Linear Waiting Costs / 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: An additive bounding procedure for the asymmetric travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hybrid Exact Algorithm for the TSPTW / 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 Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dynamic vehicle routing problem with time-dependent travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and solving several classes of arc routing problems as traveling salesman problems / 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: An Efficient Transformation Of The Generalized Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing and scheduling with dynamic travel times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for the Traveling Salesman Problem with Time Windows / rank
 
Normal rank

Latest revision as of 22:11, 27 June 2024

scientific article
Language Label Description Also known as
English
An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation
scientific article

    Statements

    An asymmetric TSP with time windows and with time-dependent travel times and costs: an exact solution through a graph transformation (English)
    0 references
    0 references
    0 references
    0 references
    24 April 2008
    0 references
    0 references
    traveling salesman problem
    0 references
    time window
    0 references
    time-dependence
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references