Results 211 to 220 of about 141,288 (266)
Genomic optimum contribution selection and mate allocation using JuMP. [PDF]
Bioinform AdvWaldmann P.
europepmc +1 more source
First detection of Diplodia bulgarica, a new pathogen causing black canker of apple trees in Poland. [PDF]
Sci RepGłos H, Michalecka M.
europepmc +1 more source
Variant Right Renal and Adrenal Arterial Supply With Associated Clinical and Embryological Perspectives. [PDF]
CureusMchonde G.
europepmc +1 more source
Ultrasound imaging of small peripheral nerves - a primer for radiologists. [PDF]
J UltrasonAgarwal A +3 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 MedGuan J +9 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Solving the Orienteering Problem through Branch-and-Cut
INFORMS Journal on Computing, 1998In 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 +2 more
openaire +3 more sources
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
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
1996
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source
Abstract As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P, it may be advantageous to divide that region into a finite number of smaller regions and optimize the objective function over each smaller region individually.
Abilio Lucena, John E Beasley
openaire +1 more source