201 search results - page 30 / 41 » Algorithms for the On-Line Quota Traveling Salesman Problem |
SODA
2010
ACM
15 years 7 months ago
2010
ACM
Many combinatorial problems--such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem-can be formulated as finding a feasible permutation of n elements. Ty...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
103
click to vote
COMBINATORICA
2010
14 years 4 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...
MP
2010
14 years 4 months ago
2010
In many practical applications, the task is to optimize a non-linear objective function over the vertices of a well-studied polytope as, e.g., the matching polytope or the travelli...
WOB
2004
14 years 11 months ago
2004
We developed a new approach for the reconstruction of phylogenetic trees using ant colony optimization metaheuristics.Atree is constructed using a fully connected graph and the pro...