Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
From MaRDI portal
Publication:2636833
Recommendations
- A polyhedral study of the quadratic traveling salesman problem
- An analysis of the asymmetric quadratic traveling salesman polytope
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- A class of exponential neighbourhoods for the quadratic travelling salesman problem
- Linear models and computational experiments for the quadratic TSP
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- An Analysis of Several Heuristics for the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- An efficient transformation of the generalized traveling salesman problem into the traveling salesman problem on digraphs
- Certification of an optimal TSP tour through 85,900 cities
- Construction heuristics for the asymmetric TSP.
- Discrete optimization methods to determine trajectories for Dubins' vehicles
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 3932819 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1933055 (Why is no real title available?)
- scientific article; zbMATH DE number 2064416 (Why is no real title available?)
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- On minimum reload cost paths, tours, and flows
- On the quadratic assignment problem
- Solution of a Large-Scale Traveling-Salesman Problem
- Solution of large-scale symmetric travelling salesman problems
- Some Basics on Tolerances
- The Angular-Metric Traveling Salesman Problem
- The traveling salesman problem and its variations
- The traveling salesman problem. A computational study.
- Tolerance Based Contract-or-Patch Heuristic for the Asymmetric TSP
- Tolerance-based Algorithms for the Traveling Salesman Problem
- Transforming asymmetric into symmetric traveling salesman problems
- Traveling salesman should not be greedy: Domination analysis of greedy-type heuristics for the TSP
- Traveling Salesperson Problems for the Dubins Vehicle
- When the greedy algorithm fails
Cited in
(14)- A linear time algorithm for the \(3\)-neighbour travelling salesman problem on a Halin graph and extensions
- Geometric and LP-based heuristics for angular travelling salesman problems in the plane
- The quadratic cycle cover problem: special cases and efficient bounds
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems
- A polyhedral study of the quadratic traveling salesman problem
- Lower bounding procedure for the asymmetric quadratic traveling salesman problem
- SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning
- Complete Description of Matching Polytopes with One Linearized Quadratic Term for Bipartite Graphs
- Minimization and maximization versions of the quadratic travelling salesman problem
- Algorithms and Experimental Study for the Traveling Salesman Problem of Second Order
- Edge sparsification for geometric tour problems
- A tabu search with geometry‐based sparsification methods for angular traveling salesman problems
- The Chvátal-Gomory procedure for integer SDPs with applications in combinatorial optimization
- A class of exponential neighbourhoods for the quadratic travelling salesman problem
This page was built for publication: Exact algorithms and heuristics for the quadratic traveling salesman problem with an application in bioinformatics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2636833)
