35 search results - page 6 / 7 » The Traveling Salesman Problem with Few Inner Points |
ICPR
2006
IEEE
14 years 7 months ago
2006
IEEE
We present a method for solving the global illumination problem for synthetic diffuse objects. The approach generates realistic shading for applications where a synthetic object i...
COMBINATORICA
2010
13 years 1 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
The Traveling Salesman Problem (TSP) is a canonical NP-complete problem which is known to be MAXSNP hard even on Euclidean metrics (of high dimensions) [40]. In order to circumven...
AI
2006
Springer
13 years 6 months ago
2006
Springer
Branch-and-bound and branch-and-cut use search trees to identify optimal solutions to combinatorial optimization problems. In this paper, we introduce an iterative search strategy...
JMLR
2006
13 years 6 months ago
2006
Given a matrix of values in which the rows correspond to objects and the columns correspond to features of the objects, rearrangement clustering is the problem of rearranging the ...