The time dependent traveling salesman problem: polyhedra and algorithm
From MaRDI portal
Recommendations
- An integer programming approach for the time-dependent TSP
- Facets and valid inequalities for the time-dependent travelling salesman problem
- scientific article; zbMATH DE number 947471
- Time‐dependent traveling salesman problem–the deliveryman case
- Heuristic Bounds and Test Problem Generation for the Time-Dependent Traveling Salesman Problem
Cites work
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3167495 (Why is no real title available?)
- scientific article; zbMATH DE number 2064406 (Why is no real title available?)
- scientific article; zbMATH DE number 947471 (Why is no real title available?)
- A classification of formulations for the (time-dependent) traveling salesman problem
- A new formulation for the traveling deliveryman problem
- A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem
- A theorem on flows in networks
- An integer programming approach for the time-dependent TSP
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Hop-indexed circuit-based formulations for the traveling salesman problem
- Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
- New facets of the STS polytope generated from known facets of the ATS polytope
- On Representatives of Subsets
- On the facial structure of set packing polyhedra
- On the solution of traveling salesman problems
- On the symmetric travelling salesman problem II: Lifting theorems and facets
- Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems
- Technical Note—An n-Constraint Formulation of the (Time-Dependent) Traveling Salesman Problem
- The Delivery Man Problem and Cumulative Matroids
- The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
- The shortest-path problem with resource constraints and \(k\)-cycle elimination for \(k\geq 3\)
- The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
- Time‐dependent traveling salesman problem–the deliveryman case
Cited in
(37)- An integer programming approach for the time-dependent TSP
- Solving the traveling delivery person problem with limited computational time
- A hybrid and adaptive evolutionary approach for multitask optimization of post-disaster traveling salesman and repairman problems
- An efficient two-phase metaheuristic algorithm for the time dependent traveling salesman problem
- Layered graph approaches for combinatorial optimization problems
- Perspectives on integer programming for time-dependent models
- Hybrid optimization methods for time-dependent sequencing problems
- Minimizing customers' waiting time in a vehicle routing problem with unit demands
- A classification of formulations for the (time-dependent) traveling salesman problem
- Facets and valid inequalities for the time-dependent travelling salesman problem
- Models and algorithms for the traveling salesman problem with time-dependent service times
- A minmax regret version of the time-dependent shortest path problem
- An integrated approach for earthwork allocation, sequencing and routing
- Minimizing total weighted latency in home healthcare routing and scheduling with patient prioritization
- Time‐dependent traveling salesman problem–the deliveryman case
- 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
- A branch-and-price algorithm for the minimum latency problem
- Dealing with time in the multiple traveling salespersons problem with moving targets
- Load-dependent and precedence-based models for pickup and delivery problems
- A branch-cut-and-price algorithm for the cumulative capacitated vehicle routing problem
- Improving dynamic programming for travelling salesman with precedence constraints: parallel Morin-Marsten bounding
- Multirobot search for a stationary object placed in a known environment with a combination of GRASP and VND
- The arc-item-load and related formulations for the cumulative vehicle routing problem
- Natural and extended formulations for the time-dependent traveling salesman problem
- Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery
- Online and offline algorithms for the time-dependent TSP with time zones
- A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
- Exact algorithms for the traveling salesman problem with draft limits
- Identification of unidentified equality constraints for integer programming problems
- A simple and effective metaheuristic for the minimum latency problem
- Tight lower bounds for the traveling salesman problem with draft limits
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- Layered graph models for the electric vehicle routing problem with nonlinear charging functions
- An asymmetric traveling salesman problem based matheuristic algorithm for flowshop group scheduling problem
- Variable neighborhood search for the travelling deliveryman problem
- A bi-criteria moving-target travelling salesman problem under uncertainty
This page was built for publication: The time dependent traveling salesman problem: polyhedra and algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1947199)
