A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
DOI10.1007/BF02187869zbMATH Open0621.90054MaRDI QIDQ1090604FDOQ1090604
Authors: Martin Kolinek 
Publication date: 1987
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131008
Recommendations
- scientific article; zbMATH DE number 1131767
- Approximation algorithms for optimal decision trees and adaptive TSP problems
- Approximation Algorithms for Optimal Decision Trees and Adaptive TSP Problems
- scientific article; zbMATH DE number 3858831
- Publication:5753758
- scientific article; zbMATH DE number 4202031
- A polynomial algorithm for a constrained traveling salesman problem
- The travelling salesman and the PQ-tree
- Implementation of a linear time algorithm for certain generalized traveling salesman problems
- The Complexity of the Lin–Kernighan Heuristic for the Traveling Salesman Problem
computational geometryhyperplaneslinear decision treeaffine testslinear incidence geometryn-city Traveling Salesman Problem
Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Other problems of combinatorial convexity (52A37)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Proving simultaneous positivity of linear forms
- A difference Picard theorem for meromorphic functions of several variables
- On the Polyhedral Decision Problem
- A Polynomial Linear Search Algorithm for the n -Dimensional Knapsack Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (3)
This page was built for publication: A polynomial-time linear decision tree for the traveling salesman problem and other NP-complete problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1090604)
