Results 271 to 280 of about 204,066 (330)
Some of the next articles are maybe not open access.
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
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
Surrogate-based branch-and-bound algorithms for simulation-based black-box optimization
Optimization and Engineering, 2022Jianyuan Zhai, Fani Boukouvala
semanticscholar +1 more source
Parallel branch-and-bound algorithms
Future Generation Computer Systems, 1989Abstract In this paper a parallel algorithm for branch-and-bound problems is sketched. It is designed to run on MIMD machines and exploits coarse grain parallelism. Due to the irregular and unpredictable behavior of branch-and-bound algorithms, it is hard to obtain a good load-balance.
J.M. Jansen, F.W. Sijstermans
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
1999
In diesem Kapitel werden wir fur die Probleme RRP/max und RIP/max auf der Basis der Generierungsschemata aus Kapitel 3 Branch-and-Bound-Algorithmen entwickeln. Grundlage des Verfahrens zur Losung von RRP/max wird Algorithmus 3.4 sein, der uber die Konstruktion T-minimaler Schedule-Geruste quasistabile Schedules generiert.
openaire +1 more source
In diesem Kapitel werden wir fur die Probleme RRP/max und RIP/max auf der Basis der Generierungsschemata aus Kapitel 3 Branch-and-Bound-Algorithmen entwickeln. Grundlage des Verfahrens zur Losung von RRP/max wird Algorithmus 3.4 sein, der uber die Konstruktion T-minimaler Schedule-Geruste quasistabile Schedules generiert.
openaire +1 more source
1986
There are so many failure modes in large structures with a high degree of redundancy that it is impossible to identify all of them a priori for estimating structural systems reliability or probability of failure. For the purpose, the β-unzipping method is discussed in chapter 6.
Palle Thoft-Christensen +1 more
openaire +1 more source
There are so many failure modes in large structures with a high degree of redundancy that it is impossible to identify all of them a priori for estimating structural systems reliability or probability of failure. For the purpose, the β-unzipping method is discussed in chapter 6.
Palle Thoft-Christensen +1 more
openaire +1 more source
1993
Branch and bound ist eine sehr flexible Technik, um effektive Losungsverfahren insbesondere fur Probleme der diskreten Optimierung zu entwickeln. Auf Grund der Moglichkeiten, die Struktur der Probleme im Losungsprozes berucksichtigen zu konnen und zu mussen, auf Grund guter Ausnutzung von zur Verfugung stehender Rechnertechnik (Anpassung an vorhandene ...
Christian Großmann, Johannes Terno
openaire +1 more source
Branch and bound ist eine sehr flexible Technik, um effektive Losungsverfahren insbesondere fur Probleme der diskreten Optimierung zu entwickeln. Auf Grund der Moglichkeiten, die Struktur der Probleme im Losungsprozes berucksichtigen zu konnen und zu mussen, auf Grund guter Ausnutzung von zur Verfugung stehender Rechnertechnik (Anpassung an vorhandene ...
Christian Großmann, Johannes Terno
openaire +1 more source