Results 171 to 180 of about 915,013 (232)
Some of the next articles are maybe not open access.
Multiple stack branch and bound
Information Processing Letters, 1991zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Sarkar, U. K. +3 more
openaire +1 more source
Results for the close-enough traveling salesman problem with a branch-and-bound algorithm
Computational optimization and applications, 2023Wenda Zhang +2 more
semanticscholar +1 more source
Multi-View Global 2D-3D Registration Based on Branch and Bound Algorithm
IEEE International Conference on Robotics and Biomimetics, 2019In image-guided minimally invasive surgery, the clinician relies on image guidance to observe, plan and navigate. In order to show invisible vessels or planning annotations in live X-ray images, or update the live information for planning, the ...
Jin Pan +4 more
semanticscholar +1 more source
Enriched workflow modelling and Stochastic Branch-and-Bound
European Journal of Operational Research, 2006zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Dörner, Karl +4 more
openaire +2 more sources
1991
These methods are commonly considered as the most efficient tools for solving integer programming problems. In Section 4.1, we describe the idea of the branch-and-bound methods and introduce the basic relations. Any branch-and-bound method, as we mentioned in Section 1.4, consists of two basic procedures: branching or partitioning of the feasible ...
openaire +1 more source
These methods are commonly considered as the most efficient tools for solving integer programming problems. In Section 4.1, we describe the idea of the branch-and-bound methods and introduce the basic relations. Any branch-and-bound method, as we mentioned in Section 1.4, consists of two basic procedures: branching or partitioning of the feasible ...
openaire +1 more source
Dual bounding procedures lead to convergent Branch–and–Bound algorithms
Mathematical Programming, 2001zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +5 more sources
Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
Optimization and Engineering, 2022Jianyuan Zhai, Fani Boukouvala
semanticscholar +1 more source
1982
As pointed out in section 2.4, multi-decision problems are represented naturally by trees in which a node x represents the set of (component) decisions actually made, and the branches from x represent the possible x‘choices of action at x’. The problem of finding an optimal composite decision is equivalent to the problem of finding an optimal path from
openaire +1 more source
As pointed out in section 2.4, multi-decision problems are represented naturally by trees in which a node x represents the set of (component) decisions actually made, and the branches from x represent the possible x‘choices of action at x’. The problem of finding an optimal composite decision is equivalent to the problem of finding an optimal path from
openaire +1 more source
Pump scheduling in drinking water distribution networks with an LP/NLP-based branch and bound
Optimization and Engineering, 2021Gratien Bonvin, S. Demassey, Andrea Lodi
semanticscholar +1 more source