Natural and extended formulations for the time-dependent traveling salesman problem (Q496646): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The traveling salesman problem with cumulative costs / 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: A New Formulation for the Travelling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints / 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: Combined route capacity and route length models for unit demand vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On extended formulations for the precedence constrained asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs / 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: Classification of travelling salesman problem formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / 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 formulation for the traveling deliveryman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative analysis of several asymmetric traveling salesman problem formulations / 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: New tighter polynomial length formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Tightening the Relaxations of Miller-Tucker-Zemlin Formulations for Asymmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of lifted path and flow-based formulations for the asymmetric traveling salesman problem with and without precedence constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate extended formulations / rank
 
Normal rank

Latest revision as of 18:52, 10 July 2024

scientific article
Language Label Description Also known as
English
Natural and extended formulations for the time-dependent traveling salesman problem
scientific article

    Statements

    Natural and extended formulations for the time-dependent traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    22 September 2015
    0 references
    time-dependent traveling salesman problem
    0 references
    extended formulations
    0 references
    projection
    0 references
    0 references

    Identifiers