4843 search results - page 143 / 969 » The Shortcut Problem - Complexity and Approximation |
128
click to vote
ESA
1998
Springer
15 years 7 months ago
1998
Springer
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
128
click to vote
EOR
2008
15 years 3 months ago
2008
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
123
click to vote
JCSS
2006
15 years 3 months ago
2006
A nearly logarithmic lower bound on the randomized competitive ratio for the metrical task systems problem is presented. This implies a similar lower bound for the extensively stu...
109
click to vote
MP
2006
15 years 3 months ago
2006
Abstract We give new error bounds for the linear complementarity problem where the involved matrix is a P-matrix. Computation of rigorous error bounds can be turned into a P-matrix...
112
click to vote
ORL
2008
15 years 3 months ago
2008
In this paper we propose a power penalty approach to linear complementarity problems (LCP) in a finite dimensional space. This approach is based on approximating the LCP by a nonl...