Pages that link to "Item:Q3937162"
From MaRDI portal
The following pages link to A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One (Q3937162):
Displayed 9 items.
- A partitioning algorithm for minimum weighted Euclidean matching (Q794175) (← links)
- Partitioning heuristics for two geometric maximization problems (Q800827) (← links)
- A useful transform of standard input data for a classical NP-complete problem (Q1058470) (← links)
- Maximal paths in random dynamic graphs (Q1104336) (← links)
- Quantizers ad the worst case Euclidean traveling salesman problem (Q1111946) (← links)
- An appraisal of computational complexity for operations researchers (Q1173532) (← links)
- A new iterative Monte Carlo approach for inverse matrix problem (Q1298607) (← links)
- Continuous approximation models in freight distribution management (Q1688432) (← links)
- On properties of geometric random problems in the plane (Q1908291) (← links)