Results 261 to 270 of about 35,838 (299)
Some of the next articles are maybe not open access.
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
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
A branch-and-bound algorithm for the acyclic partitioning problem
Computers & Operations Research, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jenny Nossack, Erwin Pesch
openaire +3 more sources
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 Algorithms for the Test Cover Problem
2002In the test cover problem a set of items is given together with a collection of subsets of the items, called tests. A smallest subcollection of tests is to be selected such that for every pair of items there is a test in the selection that contains exactly one of the two items. This problem is NP-hard in general.
de Bontridder, K.M.J. +4 more
openaire +2 more sources
Branch and bound algorithms for the multidimensional assignment problem
Optimization Methods and Software, 2005This work investigates two branch and bound algorithms based on different tree representations of the multidimensional assignment problem (MAP). The MAP may be depicted as either an index-based tree in which every level of the tree represents a different value of the first index or as a permutation-based tree that has vertices representing different ...
Eduardo L. Pasiliao +2 more
openaire +1 more source
A branch-and-bound algorithm for the cell formation problem
International Journal of Production Research, 2018The cell formation problem (CFP) is an NP-hard optimization problem considered for cell manufacturing systems. Because of its high computational complexity several heuristics have been developed for solving this problem. In this paper we present a branch and bound algorithm which provides exact solutions of the CFP.
Irina Utkina +2 more
openaire +1 more source
Constrained Branch-and-Bound algorithm for image registration
Journal of Zhejiang University-SCIENCE A, 2005Summary: The authors propose a refined branch-and-bound algorithm for affine-transformation based image registration. Given two feature point-sets in two images respectively, the authors first extract a sequence of high-probability matched point-pairs by considering well-defined features. Each resultant point-pair can be regarded as a constraint in the
Jin, Jianqui +2 more
openaire +1 more source
Coping with Anomalies in Parallel Branch-and-Bound Algorithms
IEEE Transactions on Computers, 1986A general technique that can be used to solve a wide variety of discrete optimization problems is the branch-and-bound algorithm. We have adapted and extended branch-and-bound algorithms for parallel processing. The computational efficiency of these algorithms depends on the allowance function, the data structure, and the search strategies.
Guo-Jie Li, Benjamin W. Wah
openaire +2 more sources
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