Pathology of Traveling-Salesman Subtour-Elimination Algorithms

Cited In (32)

Integer programming approaches to the travelling salesman problem
The seriation problem and the travelling salesman problem
A study of complexity transitions on the asymmetric traveling salesman problem
Models, relaxations and exact approaches for the capacitated vehicle routing problem
Some problems in discrete optimization
Establishing motion correspondence using extended temporal scope
A restricted Lagrangean approach to the traveling salesman problem
On the solutions of stochastic traveling salesman problems
Motion tracking as a constrained optimization problem.
An algorithm for the traveling salesman problem with pickup and delivery customers
The traveling salesman problem: An overview of exact and approximate algorithms
An exact algorithm for the capacitated shortest spanning arborescence
Optimization engineering techniques for the exact solution of NP-hard combinatorial optimization problems
The traveling salesman problem: A duality approach
Cluster based branching for the asymmetric traveling salesman problem
Methods for routing with time windows
A new approach to solving the multiple traveling salesperson problem using genetic algorithms
An appraisal of computational complexity for operations researchers
Solving symmetric vehicle routing problems asymmetrically
A continuous variable representation of the traveling salesman problem
Lower bounds for the symmetric travelling salesman problem from Lagrangean relaxations
An approach for solving a class of transportation scheduling problems
On the stochastic complexity of the asymmetric traveling salesman problem
The optimum assignments and a new heuristic approach for the traveling salesman problem
A genetic algorithm with a mixed region search for the asymmetric traveling salesman problem
Results from a parallel branch-and-bound algorithm for the asymmetric traveling salesman problem
A note on the complexity of the asymmetric traveling salesman problem
A Fast Lower Bound for the Minimum Cost Perfect 2-Matching Linear Program
An additive bounding procedure for the asymmetric travelling salesman problem
Maximum travelling salesman problem. I
Average-case analysis of best-first search in two representative directed acyclic graphs
The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching

This page was built for publication: Pathology of Traveling-Salesman Subtour-Elimination Algorithms

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