Implementation of a linear time algorithm for certain generalized traveling salesman problems
From MaRDI portal
Publication:4645932
DOI10.1007/3-540-61310-2_24zbMATH Open1415.90108OpenAlexW1562721326MaRDI QIDQ4645932FDOQ4645932
Authors: Neil Simonetti, E. Balas 
Publication date: 11 January 2019
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/3-540-61310-2_24
Recommendations
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- New classes of efficiently solvable generalized traveling salesman problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Exact And Heuristic Procedures For The Traveling Salesman Problem With Precedence Constraints, Based On Dynamic Programming
traveling salesman problemtime windowprecedence constraintgeneralized traveling salesman problemproblem instance
Cites Work
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A generalized insertion heuristic for the travelling salesman problem with time windows
- Technical Note—An Exact Algorithm for the Time-Constrained Traveling Salesman Problem
- New classes of efficiently solvable generalized traveling salesman problems
- Local Search for the Asymmetric Traveling Salesman Problem
Cited In (16)
- Solution of real-world postman problems
- A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
- Simple algorithms for gilmore-gomory's traveling salesman and related problems
- Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks
- A survey of very large-scale neighborhood search techniques
- Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
- Domination analysis of some heuristics for the traveling salesman problem
- Large multiple neighborhood search for the clustered vehicle-routing problem
- Lin-Kernighan heuristic adaptations for the generalized traveling salesman problem
- Large multiple neighborhood search for the soft-clustered vehicle-routing problem
- Scheduling for multi-robot routing with blocking and enabling constraints
- TSP tour domination and Hamilton cycle decompositions of regular digraphs
- Construction heuristics for the asymmetric TSP.
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Title not available (Why is that?)
- Polynomial approximation algorithms for the TSP and the QAP with a factorial domination number
This page was built for publication: Implementation of a linear time algorithm for certain generalized traveling salesman problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4645932)
