Results 281 to 290 of about 204,066 (330)
Some of the next articles are maybe not open access.
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
Soft Computing - A Fusion of Foundations, Methodologies and Applications, 2021
Yaghoub Alipouri
semanticscholar +1 more source
Yaghoub Alipouri
semanticscholar +1 more source
2018
The paper proposes an implementation of the Branch-and-Bound method for an enterprise grid based on the BOINC infrastructure. The load distribution strategy and the overall structure of the developed system are described with special attention payed to some specific issues such as incumbent updating and load distribution.
Andrei Ignatov, Mikhail Posypkin
openaire +1 more source
The paper proposes an implementation of the Branch-and-Bound method for an enterprise grid based on the BOINC infrastructure. The load distribution strategy and the overall structure of the developed system are described with special attention payed to some specific issues such as incumbent updating and load distribution.
Andrei Ignatov, Mikhail Posypkin
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
1994
Whereas exact methods for solving the single-mode resource-constrained project scheduling problem are well documented in the literature (cf. e.g. [7], [18], [25], [27], [32], [33], [33], [95], [101], [112], [113]), the multi-mode extension has attracted less attention (cf. [88], [89], [109], [114], [115], [116]).
openaire +1 more source
Whereas exact methods for solving the single-mode resource-constrained project scheduling problem are well documented in the literature (cf. e.g. [7], [18], [25], [27], [32], [33], [33], [95], [101], [112], [113]), the multi-mode extension has attracted less attention (cf. [88], [89], [109], [114], [115], [116]).
openaire +1 more source
2000
In this chapter, we describe a branch-and-bound algorithm for the DSP in which to embed the constraint propagation techniques that we have derived in the last chapter. A general introduction to branch-and-bound has been given in section 2.3. As mentioned there, one of the most important components of a branch-and-bound solution method is a branching ...
openaire +1 more source
In this chapter, we describe a branch-and-bound algorithm for the DSP in which to embed the constraint propagation techniques that we have derived in the last chapter. A general introduction to branch-and-bound has been given in section 2.3. As mentioned there, one of the most important components of a branch-and-bound solution method is a branching ...
openaire +1 more source
Branch and Bound: Eine Einfuehrung
1973Die Verkehrsbetriebe einer Stadt unterhalten ein Netz von 5 Linien mit folgendem maximalen Wagenbedarf pro Linie: Der Wagenpark betragt 80 Fahrzeuge, es stehen also jeweils mindestens 6 Fahrzeuge ausser Betrieb (Revisionen, Reparaturen, Einsatzmoglichkeit bei Notfallen, etc.).
openaire +1 more source