A Polynomial-Time Linear Decision Tree for the Traveling Salesman Problem and Other NP-complete Problems

Discrete and Computational Geometry - United States
doi 10.1007/bf02187869
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2018English

Polynomial Time Approximation Schemes for the Traveling Repairman and Other Minimum Latency Problems.

2013English

A QUBO Model for the Traveling Salesman Problem With Time Windows

Algorithms
MathematicsComputational MathematicsNumerical AnalysisTheoretical Computer ScienceComputational Theory
2019English

The Traveling Salesman Problem

English

Traveling Salesman Problem

2011English

Traveling Salesman Problem

English

A Memetic Algorithm for the Generalized Traveling Salesman Problem

Natural Computing
Computer Science Applications
2009English

Fixed-Parameter Algorithms for Rectilinear Steiner Tree and Rectilinear Traveling Salesman Problem in the Plane

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2018English

Exact Algorithms for the Equitable Traveling Salesman Problem

SSRN Electronic Journal
2016English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy