Facets and valid inequalities for the time-dependent travelling salesman problem (Q2514741): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Lifted Cycle Inequalities for the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the dimension of projected polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times / 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: Technical Note—An <i>n</i>-Constraint Formulation of 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 traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistars, partial multistars and the capacitated vehicle routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / 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: A new branch-and-cut algorithm for the capacitated vehicle routing problem / 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: 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: Scheduling in a sequence dependent setup environment with genetic search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4715981 / rank
 
Normal rank

Latest revision as of 15:09, 9 July 2024

scientific article
Language Label Description Also known as
English
Facets and valid inequalities for the time-dependent travelling salesman problem
scientific article

    Statements

    Facets and valid inequalities for the time-dependent travelling salesman problem (English)
    0 references
    0 references
    0 references
    3 February 2015
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    time-dependent TSP
    0 references
    branch and cut
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references