scientific article; zbMATH DE number 808804
From MaRDI portal
Publication:4852853
zbMATH Open0841.90119MaRDI QIDQ4852853FDOQ4852853
Authors: Eh. Kh. Gimadi, N. I. Glebov, A. I. Serdyukov 
Publication date: 17 March 1996
Title of this publication is not available (Why is that?)
Recommendations
- Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances
- scientific article; zbMATH DE number 3869068
- scientific article; zbMATH DE number 4095236
- On the approximability of the traveling salesman problem
- Approximation algorithms for the traveling salesman problem
- On the approximability of the traveling salesman problem (extended abstract)
- The traveling salesman problem. Approximate algorithms
- An approximation algorithm for the maximum traveling salesman problem
- An approximation algorithm for the maximum traveling salesman problem
- scientific article; zbMATH DE number 1264413
Cited In (18)
- Aggregation for the probabilistic traveling salesman problem
- Probabilistic Algorithm for the Directed Traveling Salesman Problem
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines
- Title not available (Why is that?)
- Probabilistic Analysis of Assignment Ranking: The Traveling Salesman Problems
- Title not available (Why is that?)
- Probabilistic analysis of an approximation algorithm for the traveling salesman problem on unbounded from above instances
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route
- A Priori Optimization of the Probabilistic Traveling Salesman Problem
- Probability Modelling and Optimal Location of a Travelling Salesman
- On the Exact Solution of Random Travelling Salesman Problems with Medium Size Integer Coefficients
- Computing the variance of tour costs over the solution space of the TSP in polynomial time
- On some probability inequalities for some discrete optimization problems
- Parameter optimisation of the polynomial randomised algorithm for the asymmetric travelling salesman problem
- Operational estimators for the length of a traveling salesman tour
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above
- Approximate algorithms for the traveling salesman problem. II
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4852853)
