The following pages link to (Q4852853):
Displaying 11 items.
- Probabilistic analysis of an approximation algorithm for the \(m\)-peripatetic salesman problem on random instances unbounded from above (Q492278) (← links)
- Approximate algorithms for the traveling salesman problem. II (Q499569) (← links)
- Polynomial algorithms for finding the asymptotically optimum plan of the multiindex axial assignment problem (Q852261) (← links)
- Operational estimators for the length of a traveling salesman tour (Q1206381) (← links)
- Computing the variance of tour costs over the solution space of the TSP in polynomial time (Q1935572) (← links)
- Approximate algorithms with estimates for routing problems on random inputs with a bounded number of customers per route (Q2261716) (← links)
- Aggregation for the probabilistic traveling salesman problem (Q2489311) (← links)
- Hardness Results for the Probabilistic Traveling Salesman Problem with Deadlines (Q3167642) (← links)
- Probabilistic Algorithm for the Directed Traveling Salesman Problem (Q3730366) (← links)
- Probability Modelling and Optimal Location of a Travelling Salesman (Q4018541) (← links)
- A Priori Optimization of the Probabilistic Traveling Salesman Problem (Q4305756) (← links)
