Results 111 to 120 of about 140,088 (167)

Utilization of Zenith Alpha Thoracic 2.0 to facilitate physician-modified triple retrograde inner branched endovascular repair of the aortic arch via a single percutaneous femoral access. [PDF]

J Vasc Surg Cases Innov Tech
Tackett C, Han K, Estrera G, Fleischman F, Han SM.   +4 more
europepmc   +1 more source

Correlation between inflammatory burden index and hemorrhage expansion among large-artery atherosclerosis acute ischemic stroke with hemorrhagic transformation. [PDF]

BMC Neurol
Yang Y, Han Y, Shen S, Wan M, Wu M, Zhang Y.   +5 more
europepmc   +1 more source

An evaluation of the effectiveness of 3D virtual imaging combined with intraoperative ultrasonography to guide liver staining in anatomic segmental hepatectomy. [PDF]

Glob Health Med
Guan J, Liang R, Peng Y, Yu X, Yuan R, Hu Z, Wu H, Zhou B, Qiu Y, Wang K.   +9 more
europepmc   +1 more source

Safety and Feasibility of the Plantar Portal Technique in the Surgical Management of Plantar Fasciitis: A Cadaveric Study. [PDF]

J Foot Ankle Res
Yilmaz E, Yozgatli TK, Aktekin A, Ozturk O, Aktekin M, Kocaoglu B.   +5 more
europepmc   +1 more source

Quasisymmetries of finitely ramified Julia sets. [PDF]

Math Ann
Belk J, Forrest B.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Solving the Orienteering Problem through Branch-and-Cut

INFORMS Journal on Computing, 1998
In the Orienteering Problem (OP), we are given an undirected graph with edge weights and node prizes. The problem calls for a simple cycle whose total edge weight does not exceed a given threshold, while visiting a subset of nodes with maximum total prize. This NP-hard problem arises in routing and scheduling applications. We describe a branch-and-cut
FISCHETTI, MATTEO, J. S. Gonzalez, P. Toth   +2 more
openaire   +3 more sources

Branch-and-Cut

2010
This chapter focuses on the approach for solving the LOP to optimality which can currently be seen as the most successful one. It is a branch-and-bound algorithm, where the upper bounds are computed using linear programming relax- ations.
Rafael Martí, Gerhard Reinelt
openaire   +1 more source