In this paper, we consider some procedures for solving several kinds of constrained shortest path problems in the Adleman-Lipton model. These procedures work (in spite of the NP-completeness of the problems)in polynomial time for an edge-weighted graph in Adleman-Lipton mode
