Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
From MaRDI portal
Recommendations
- The probabilistic relationship between the assignment and asymmetric traveling salesman problems.
- scientific article; zbMATH DE number 3932819
- scientific article; zbMATH DE number 808804
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- The Probabilistic Relationship Between the Assignment and Asymmetric Traveling Salesman Problems
Cites work
- A versatile scheme for ranking the extreme points of an assignment polytope
- An Algorithm for the Traveling Salesman Problem
- Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
- Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
- Probabilistic analysis of solving the assignment problem for the traveling salesman problem
- The Traveling Salesman Problem: A Survey
Cited in
(7)- Aggregation for the probabilistic traveling salesman problem
- scientific article; zbMATH DE number 2118621 (Why is no real title available?)
- Heuristic methods and applications: A categorized survey
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Probability Modelling and Optimal Location of a Travelling Salesman
- A Probabilistic Approach to Solving Assignment Problems
- Probabilistic analysis of the generalised assignment problem
This page was built for publication: Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3346092)
