A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
From MaRDI portal
(Redirected from Publication:1158108)
Cites work
- scientific article; zbMATH DE number 3575371 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- A Dynamic Programming Approach to Sequencing Problems
- A note on two problems in connexion with graphs
- Computer Solutions of the Traveling Salesman Problem
- Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
- On the shortest spanning subtree of a graph and the traveling salesman problem
- The Shortest Hamiltonian Chain of a Graph
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(37)- Mapping tree-structured combinatorial optimization problems onto parallel computers
- Bounds for the symmetric 2-peripatetic salesman problem
- Symmetric traveling salesman problems
- A multiple traveling salesman problem model for hot rolling scheduling in Shanghai Baoshan Iron \& Steel Complex
- An empirical study of a new metaheuristic for the traveling salesman problem
- Embedding learning capability in Lagrangean relaxation: an application to the travelling salesman problem
- A note on relatives to the Held and Karp 1-tree problem
- Optimizing tabu list size for the traveling salesman problem
- The traveling salesman problem: An overview of exact and approximate algorithms
- New lower bounds for the symmetric travelling salesman problem
- Lower bounding techniques for frequency assignment
- The symmetric traveling salesman problem and edge exchanges in minimal 1- trees
- Stability aspects of the traveling salesman problem based on \(k\)-best solutions
- TSP race: minimizing completion time in time-sensitive applications
- Sensitivity analysis for symmetric 2-peripatetic salesman problems
- Coarse-Graining Large Search Landscapes Using Massive Edge Collapse
- Exact hybrid algorithms for solving a bi-objective vehicle routing problem
- A branch and bound algorithm for symmetric 2-peripatetic salesman problems
- Estimating the Held-Karp lower bound for the geometric TSP
- A framework for multi-robot node coverage in sensor networks
- Improving heuristics for the frequency assignment problem
- A discrete cross aisle design model for order-picking warehouses
- Efficient optimization of the Held-Karp lower bound
- A branch-and-bound algorithm for the singly constrained assignment problem
- A simulation tool for the performance evaluation of parallel branch and bound algorithms
- Learning-based TSP-solvers tend to be overly greedy
- The symmetric clustered traveling salesman problem
- Travelling salesman problem tools for microcomputers
- Identification of non-optimal arcs for the traveling salesman problem
- The team orienteering problem with service times and mandatory \& incompatible nodes
- A useful transform of standard input data for a classical NP-complete problem
- Iterative state-space reduction for flexible computation
- An efficient heuristic algorithm for the bottleneck traveling salesman problem
- Using logical surrogate information in Lagrangean relaxation: An application to symmetric traveling salesman problems
- An effective implementation of the Lin-Kernighan traveling salesman heuristic
- Edge exchanges in the degree-constrained minimum spanning tree problem
- The symmetric travelling salesman problem. II: New low bounds
This page was built for publication: A branch and bound algorithm for the symmetric traveling salesman problem based on the 1-tree relaxation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1158108)
