Results 181 to 190 of about 915,013 (232)
Some of the next articles are maybe not open access.
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
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2021
Yaghoub Alipouri
semanticscholar +1 more source
Yaghoub Alipouri
semanticscholar +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
Ein Branch-and-Bound-Verfahren
2000In diesem Kapitel stellen wir ein Branch-and-Bound-Verfahren zur Bestimmung einer optimalen Losung einer MRCPSP/max-Instanz (P) vor. Das Verfahren basiert auf dem in Abschnitt 2.3 beschriebenen Integrationsansatz. Zur Wurzel des Enumerationsbaums korrespondiert eine Minimalprobleminstanz (\({P^{\tilde M}}\)), wobei der Minimalmodusmengenvektor \(\tilde
openaire +1 more source
2002
This chapter describes a time-oriented, constraint propagation based approach to resource-constrained project scheduling with generalised precedence constraints. We present a branch-and-bound algorithm for the general problem PS |temp| C max that enumerates possible activity start times based on the idea that, at a given node of the search tree, an ...
openaire +1 more source
This chapter describes a time-oriented, constraint propagation based approach to resource-constrained project scheduling with generalised precedence constraints. We present a branch-and-bound algorithm for the general problem PS |temp| C max that enumerates possible activity start times based on the idea that, at a given node of the search tree, an ...
openaire +1 more source
2019
This chapter presents a generic branch-and-bound-type algorithm, proposed by the author. It is shown, how this sort of algorithms can be applied to solving general problems, described by logical formulae, possibly with quantifiers. The general schema of such methods and their most general properties and features are presented.
openaire +1 more source
This chapter presents a generic branch-and-bound-type algorithm, proposed by the author. It is shown, how this sort of algorithms can be applied to solving general problems, described by logical formulae, possibly with quantifiers. The general schema of such methods and their most general properties and features are presented.
openaire +1 more source
Branch and Bound: Eine Einführung
1973Es gibt eine grosse Menge von betriebswirtschaftlichen Entscheidungsfragen, die sich mit den nunmehr bereits als herkommlich geltenden Optimierungs methoden des Operations Research nicht behandeln la sen, sei es beispiels weise, dass die Zielfunktion und auch einzelne Restriktionen nicht konvex sind, sei es, dass nur ganzzahlige Losungen toleriert ...
openaire +1 more source