An integer programming approach for the time-dependent TSP

DOI10.1016/J.ENDM.2010.05.045MaRDI QIDQ2883581zbMATH OpenOpenAlexFDO

Authors Juan José Miranda-Bront, Isabel Méndez-Díaz, Paula Zabala

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.045

zbMATH Keywords

branch and cutcombinatorial optimizationTDTSP

Mathematics Subject Classification ID

Integer programming (90C10) Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Facets and valid inequalities for the time-dependent travelling salesman problem
• The time dependent traveling salesman problem: polyhedra and algorithm
• Time‐dependent traveling salesman problem–the deliveryman case
• scientific article; zbMATH DE number 947471
• A classification of formulations for the (time-dependent) traveling salesman problem

Cites work

• A classification of formulations for the (time-dependent) traveling salesman problem
• A new formulation for the traveling deliveryman problem
• scientific article; zbMATH DE number 947471 (Why is no real title available?)
• Lifted cycle inequalities for the asymmetric traveling salesman problem
• On the dimension of projected polyhedra
• Scheduling in a sequence dependent setup environment with genetic search
• Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
• The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
• The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times

Cited in

(21)

• A classification of formulations for the (time-dependent) traveling salesman problem
• An integer programming approach for the time-dependent traveling salesman problem with time windows
• A meta-heuristic based goal-selection strategy for mobile robot search in an unknown environment
• Hybrid optimization methods for time-dependent sequencing problems
• The time dependent traveling salesman problem: polyhedra and algorithm
• Perspectives on integer programming for time-dependent models
• Rejoinder on: ``Perspectives on integer programming for time-dependent models
• An assign-and-route matheuristic for the time-dependent inventory routing problem
• An enhanced lower bound for the time-dependent travelling salesman problem
• An integer programming approach for the Chinese postman problem with time-dependent travel time
• A multi-period TSP with stochastic regular and urgent demands
• Facets and valid inequalities for the time-dependent travelling salesman problem
• On path ranking in time-dependent graphs
• Solving TSP through the integration of OR and CP techniques
• Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
• TSP race: minimizing completion time in time-sensitive applications
• Time-dependent routing problems: a review
• scientific article; zbMATH DE number 947471 (Why is no real title available?)
• Natural and extended formulations for the time-dependent traveling salesman problem
• Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
• Comparing four MILP formulations for the time-dependent inventory routing problem with FIFO-compliant travel times

This page was built for publication: An integer programming approach for the time-dependent TSP

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883581)