Results 251 to 260 of about 178,189 (288)
Some of the next articles are maybe not open access.
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
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
Branch-and-bound algorithms on a hypercube
Proceedings of the third conference on Hypercube concurrent computers and applications -, 1988The parallel implementation of branch-and-bound algorithms on multiprocessors has received an increasing amount of attention in recent years. This paper describes research currently being conducted at Clemson University. We study the job scheduling problem: given n jobs, each with processing time, pi, and due date, di, schedule these jobs on a single ...
R. P. Pargas, D. E. Wooster
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
Computational Efficiency of Approximate Branch-and-Bound Algorithms
Mathematics of Operations Research, 1976To improve the computational efficiency of a branch-and-bound algorithm at the sacrifice of obtaining an optimal solution, the lower bound test is sometimes strengthened beyond its limit, i.e., a partial problem Pi is terminated if g(Pi) ≥ z − ϵ(z) (instead of g(Pi) ≥ z), where g(Pi) is a lower bound of Pi, z is the current incumbent value and ϵ(z ...
openaire +1 more source
An asynchronous parallel branch‐and‐bound algorithm
Systems and Computers in Japan, 1992AbstractThis paper presents a parallel branch‐and‐bound algorithm which is applicable to a loosely coupled multiprocessor with nonhierarchical interconnection network such as torus or hypercube. This algorithm is asynchronous and processing elements (PEs) start evaluation of nodes without being synchronized.
Tsuyoshi Kawaguchi +2 more
openaire +1 more source
Fault-Tolerant Mechanism for Hierarchical Branch and Bound Algorithm
2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum, 2011Solving exactly large instances of Combinatorial Optimization Problems emph{(COPs)} using Branch and Bound emph{(B&B) }algorithms requires a huge amount of computing resources. These resources can be offered by computational grids and the scalability can be achieved using Hierarchical Master/Worker-based B&B pushing the limits of the traditional Master/
Bendjoudi, Ahcène +2 more
openaire +2 more sources
The geometric branch-and-bound algorithm
2011The aim of this chapter is the presentation of the fundamental geometric branch-and-bound algorithm including a general convergence theory. To this end, we start with a literature review of these approaches and their applications to facility location problems in Section 2.1.
openaire +1 more source
A Branch and Bound Algorithm for Feature Subset Selection
IEEE Transactions on Computers, 1977A feature subset selection algorithm based on branch and bound techniques is developed to select the best subset of m features from an n-feature set. Existing procedures for feature subset selection, such as sequential selection and dynamic programming, do not guarantee optimality of the selected feature subset. Exhaustive search, on the other hand, is
Narendra, Patrenahalli M. +1 more
openaire +1 more source
A Branch and Bound Algorithm for Numerical MAX-CSP
Constraints, 2008zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Normand, Jean-Marie +3 more
openaire +4 more sources