Isbn: 9781332986781 - probabilistic analysis of the 1-tree relaxation for the euclidean traveling salesman problem (classic reprint) (3 resultados)

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000.

Paperback. Condición: New. Print on Demand. This book delves into the probabilistic analysis of the Held-Karp lower bound, a key concept for solving the Euclidean Traveling Salesman Problem (ETSP). The ETSP is a classic combinatorial optimization problem that finds applications in various fields, such as logistics and circuit board designing. The Held-Karp lower bound provides a crucial estimate for the length of the optimal tour in the ETSP. The author takes a novel approach by combining the combinatorial interpretation of the lower bound with the theory of subadditive Euclidean functionals. This enables a probabilistic analysis of the bound, leading to new insights into its behavior. The book establishes that the Held-Karp lower bound is asymptotically close to a constant times the optimal tour length when the number of points in the ETSP tends to infinity. This result provides a theoretical explanation for the practical observation that the lower bound often closely approximates the optimal solution. The analysis also establishes the complete convergence of the Held-Karp lower bound, a significant theoretical result that further strengthens the understanding of its behavior. Overall, this book offers a rigorous and innovative examination of the Held-Karp lower bound, contributing to the understanding of both the ETSP and probabilistic analysis in combinatorial optimization. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item. …