An enhanced lower bound for the time-dependent travelling salesman problem (Q2333147): Difference between revisions

From MaRDI portal
Changed an Item
Created claim: Wikidata QID (P12): Q127291010, #quickstatements; #temporary_batch_1722802475495
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2019.104795 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2971416083 / 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: Time-dependent asymmetric traveling salesman problem with time windows: properties and an exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some New Branching and Bounding Criteria for the Asymmetric Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—An <i>n</i>-Constraint Formulation of the (Time-Dependent) Traveling Salesman 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: The moving-target traveling salesman problem / 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: The next wave in computing, optimization, and decision technologies. Papers from the ninth INFORMS Computing Society conference (ICS 2005), Annapolis, MD, USA, January 5--7, 2005. / 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: A Time-Dependent No-Overlap Constraint: Application to Urban Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming approach for the time-dependent TSP / 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: 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: The time-dependent traveling salesman problem / 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
Property / cites work
 
Property / cites work: Q4715981 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127291010 / rank
 
Normal rank

Latest revision as of 22:14, 4 August 2024

scientific article
Language Label Description Also known as
English
An enhanced lower bound for the time-dependent travelling salesman problem
scientific article

    Statements

    An enhanced lower bound for the time-dependent travelling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    11 November 2019
    0 references
    travelling salesman problem
    0 references
    time dependence
    0 references
    lower and upper bounds
    0 references
    branch-and-cut
    0 references
    0 references
    0 references

    Identifiers