Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

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

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

2015

2015

The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs… Expand

2014

2014

We consider the Bipartite Boolean Quadratic Programming Problem (BQP01), which generalizes the well-known Boolean Quadratic… Expand

2009

2009

An intensive practical experimentation is certainly required for the purpose of heuristics design and evaluation, however a… Expand

2006

2006

Let P be a combinatorial optimization problem, and let A be an approximation algorithm for P. The domination ratio domr(A, s) is… Expand

2004

2004

We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm… Expand

2003

2003

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classification of combinatorial… Expand

Highly Cited

2002

Highly Cited

2002

We show that the 2-Opt and 3-Opt heuristics for the traveling salesman problem (TSP) on the complete graph Kn produce a solution… Expand

Highly Cited

2002

Highly Cited

2002

Abstract Computational experiments show that the greedy algorithm (GR) and the nearest neighbor algorithm (NN), popular choices… Expand

2001

2001

In this paper, we solve a problem by Glover and Punnen (J. Oper. Res. Soc. 48 (1997) 502-510) from the context of domination… Expand

Highly Cited

2001

Highly Cited

2001

A series of local factors such as substrate structure, presence or absence of kelp forests and environmental variables play an… Expand