Skip to search formSkip to main content

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

2017

2017

The travelling salesman problem (TSP) asks for a shortest tour through all vertices of a graph with respect to the weights of the… Expand

Is this relevant?

2013

2013

We design and analyse approximation algorithms for the minimum-cost connectedT-join problem: given an undirected graph G=(V,E… Expand

Is this relevant?

2006

2006

The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational… Expand

Is this relevant?

2004

2004

Very little theory is available to explain the reasons underlying ACO’s success. A population–based ACO (P-ACO) variant is used… Expand

Is this relevant?

2003

2003

The Euclidean Traveling Salesperson Problem (E-TSP) is a useful task to study how humans optimize when faced with computational… Expand

Is this relevant?

2001

2001

The first commercial wireline telephone switchboard, an ungainly manual contraption, began operation in New Haven, Connecticut on… Expand

Is this relevant?

2000

2000

This paper extends our earlier work in developing statistically optimal algorithms for estimating the range- dependent… Expand

Is this relevant?

1979

1979

A procedure for substructure search in polycyclic systems based upon the concept of atom codes and their comparison is outlined… Expand

Is this relevant?

1978

1978