scientific article; zbMATH DE number 4053382

From MaRDI portal
Publication:3789368





In the first part of the paper variants of approximate algorithms for the traveling salesman problem are given. The main idea is decomposing the problem into subproblems in a tree-like manner with subsequent solution of stical decision problems (minimax decisions and set-valued estimators). The book is written in a rigorous mathematical language. An appendix collects necessary tools from the areas of measure and measurability theory, (convex) analysis and fixed-point theory.











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 Q3789368)