Artículos relacionados a Probabilistic Analysis of the 1-Tree Relaxation for...
Probabilistic Analysis of the 1-Tree Relaxation for the Euclidean Traveling Salesman Problem (Classic Reprint) - Tapa blanda
Sinopsis
Excerpt from Probabilistic Analysis of the 1-Tree Relaxation for the Euclidean Traveling Salesman Problem
Christofides [3] and Johnson the relative gap is often less or much less than l%. On a theoretical ground, a result due to Wolsey [21] states that the Held Karp lower bound is never less than of the length of the optimal tour when the triangle inequality is satisfied. However, this worst - case analysis does not capture the efficiency of the bound in practice. The probabilistic analysis developed in this paper is aimed at shedding new light on the behavior of the held-karp lower bound.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sinopsis" puede pertenecer a otra edición de este libro.
Reseña del editor
Excerpt from Probabilistic Analysis of the 1-Tree Relaxation for the Euclidean Traveling Salesman Problem
Christofides [3] and Johnson the relative gap is often less or much less than l%. On a theoretical ground, a result due to Wolsey [21] states that the Held Karp lower bound is never less than of the length of the optimal tour when the triangle inequality is satisfied. However, this worst - case analysis does not capture the efficiency of the bound in practice. The probabilistic analysis developed in this paper is aimed at shedding new light on the behavior of the held-karp lower bound.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
Reseña del editor
Excerpt from Probabilistic Analysis of the 1-Tree Relaxation for the Euclidean Traveling Salesman Problem
In this section we summarize the main results of Held and Karp They presented a lewer bound on the length of the optimal tour to the symmetric traveling salesman problem on the compleete undirected graph with vertex set V. This bound 'can be described in several equivalent ways.
About the Publisher
Forgotten Books publishes hundreds of thousands of rare and classic books. Find more at www.forgottenbooks.com
This book is a reproduction of an important historical work. Forgotten Books uses state-of-the-art technology to digitally reconstruct the work, preserving the original format whilst repairing imperfections present in the aged copy. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in our edition. We do, however, repair the vast majority of imperfections successfully; any imperfections that remain are intentionally left to preserve the state of such historical works.
"Sobre este título" puede pertenecer a otra edición de este libro.
Comprar nuevo
Ver este artículo
EUR 18,41
EUR 0,61 gastos de envío desde Estados Unidos de America a España
Destinos, gastos y plazos de envío
Resultados de la búsqueda para Probabilistic Analysis of the 1-Tree Relaxation for...
Imagen de archivo
Probabilistic Analysis of the 1Tree Relaxation for the Euclidean Traveling Salesman Problem Classic Reprint
Librería: PBShop.store US, Wood Dale, IL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332986781
Cantidad disponible: 15 disponibles
Imagen de archivo
Probabilistic Analysis of the 1Tree Relaxation for the Euclidean Traveling Salesman Problem Classic Reprint
Librería: PBShop.store UK, Fairford, GLOS, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
PAP. Condición: New. New Book. Shipped from UK. Established seller since 2000. Nº de ref. del artículo: LW-9781332986781
Cantidad disponible: 15 disponibles
Imagen del vendedor
Probabilistic Analysis of the 1-Tree Relaxation for the Euclidean Traveling
Impresión bajo demandaLibrería: Forgotten Books, London, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
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. Nº de ref. del artículo: 9781332986781_0
Cantidad disponible: Más de 20 disponibles