eldorado.tu-dortmund.de/server/api/core/bitstreams/d6ca5dc0-756d-4f45-8c4c-4f2ac0572f02/content
Computational Recognition of RNA Splice Sites by Exact Algorithms for the Quadratic Traveling Salesm
y, we set:
cl((j, k)) :=
H(Xk) j = 0
H(Xk|Xj) j, k ∈ V
0 otherwise
cq((i, j, k)) :=
H(Xk) j = 0
H(Xk|Xj) i = 0
H(Xk|Xij) i, j, k ∈ V
0 otherwise
for arcs (j, k) ∈ V (2) and two-arcs [...] modeling the QHPP, we consider a QTSP on the complete graphGwith set of nodes V = V ∪{0}, where the artificial node 0 is used to model the first summands in Equation (1) and to allow for a complete definition [...] v) is part of the tour.
In the BnC approach, we use constraints (3) and (6), ra ∈ [0, 1], a ∈ A, and t(u,v,w) ∈ [0, 1],
(u, v, w) ∈ V (3), as a basic relaxation. In order to obtain an exact algorithm …
