Results 1  10
of
336,103
PComplete Approximation Problems
, 1976
"... For Pcomplete problems such as traveling salesperson, cycle covers, 01 integer programming, multicommodity network flows, quadratic assignment, etc, it is shown that the approximation problem is also Pcomplete In contrast with these results, a linear time approximation algorithm for the clusterin ..."
Abstract

Cited by 376 (0 self)
 Add to MetaCart
For Pcomplete problems such as traveling salesperson, cycle covers, 01 integer programming, multicommodity network flows, quadratic assignment, etc, it is shown that the approximation problem is also Pcomplete In contrast with these results, a linear time approximation algorithm
on the travelling salesperson problem
, 1999
"... Spatial and contextual factors in human performance ..."
Salesperson Problem
"... Recall Arora's polynomialtime approximation algorithm to the travelling salesperson problem on the bounded Euclidean plane [1]. Choose a (w.l.o.g. vertical) line l across the bounding boxFix 1=ffl evenly spaced "portal " points on l for every subset S of the portal points do ..."
Abstract
 Add to MetaCart
Recall Arora's polynomialtime approximation algorithm to the travelling salesperson problem on the bounded Euclidean plane [1]. Choose a (w.l.o.g. vertical) line l across the bounding boxFix 1=ffl evenly spaced "portal " points on l for every subset S of the portal points
Pinpoint: Problem Determination in Large, Dynamic Internet Services
 In Proc. 2002 Intl. Conf. on Dependable Systems and Networks
, 2002
"... Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today's large, distributed, and dynamic application environments such as ecommerce systems. In this paper, we present a dynamic analysis methodology that automates problem ..."
Abstract

Cited by 299 (11 self)
 Add to MetaCart
Traditional problem determination techniques rely on static dependency models that are difficult to generate accurately in today's large, distributed, and dynamic application environments such as ecommerce systems. In this paper, we present a dynamic analysis methodology that automates
TSP  Infrastructure for the Traveling Salesperson Problem
 JOURNAL OF STATISTICAL SOFTWARE
, 2006
"... The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving the TSP ..."
Abstract

Cited by 18 (2 self)
 Add to MetaCart
The traveling salesperson or salesman problem (TSP) is a well known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. Despite this simple problem statement, solving
The backbone of the travelling salesperson
 IN: PROCEEDINGS OF THE 19TH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE (IJCAI’05
"... We study the backbone of the travelling salesperson optimization problem. We prove that it is intractable to approximate the backbone with any performance guarantee, assuming that P!=NP and there is a limit on the number of edges falsely returned. Nevertheless, in practice, it appears that much of t ..."
Abstract

Cited by 15 (0 self)
 Add to MetaCart
We study the backbone of the travelling salesperson optimization problem. We prove that it is intractable to approximate the backbone with any performance guarantee, assuming that P!=NP and there is a limit on the number of edges falsely returned. Nevertheless, in practice, it appears that much
Travelling Salesperson Problem for dynamic systems
"... fastest closed trajectory for a controlled dynamic system such that its output visits all points in a given (finite) set. We present an algorithm that, if the n points are randomly sampled from a uniform distribution, produces an output trajectory the expected duration of which scales within a const ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
fastest closed trajectory for a controlled dynamic system such that its output visits all points in a given (finite) set. We present an algorithm that, if the n points are randomly sampled from a uniform distribution, produces an output trajectory the expected duration of which scales within a constant factor of the optimum asymptotically in n. 1.
Cognitive Approaches to the Traveling Salesperson Problem: Perceptual Complexity that Produces Computational Simplicity
"... The Traveling Salesperson Problem (TSP) is a classical problem in complexity theory that has provided significant motivation for the development of that theory. The TSP has also shown that exact solutions come at a high price: exponential time complexity. As a result, heuristic solutions to the TSP ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
The Traveling Salesperson Problem (TSP) is a classical problem in complexity theory that has provided significant motivation for the development of that theory. The TSP has also shown that exact solutions come at a high price: exponential time complexity. As a result, heuristic solutions to the TSP
Children's Performance on the Euclidean Traveling Salesperson Problem
"... The Euclidean Traveling Salesperson Problem (ETSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding high quality solutions for ETSP in relatively short time and with seemingly little cognitive effort ..."
Abstract
 Add to MetaCart
The Euclidean Traveling Salesperson Problem (ETSP) is a useful task to study how humans optimize when faced with computational intractability. It has been found that humans are capable of finding high quality solutions for ETSP in relatively short time and with seemingly little cognitive
Results 1  10
of
336,103