H. W. J. M. Trienekens and A. de Bruin, Towards a Taxonomy of Parallel Branch and Bound Algorithms, Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam (1992). Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Library Hierarchy for Implementing Scalable Parallel.. - Ralphs, Ladanyi.. (2004) (Correct)
....of information that must be generated and maintained in order to guide the search. We call such information knowledge. Knowledge discovered during the search process is stored in knowledge bases of various types that communicate with each other through knowledge brokers to execute the search. In [35], Trienekens and De Bruin suggested that the organization of knowledge bases and the way in which they share knowledge is essentially what di erentiates various implementations of parallel branch and bound. This will be our premise as well. Because knowledge discovered during the search process ....
....is rich and varied. We concentrate here on those works most closely related to our own. Kumar and Gupta provide an excellent general introduction to the analysis of parallel scalability in [21] Good overviews and taxonomies of parallel branch and bound algorithms are provided in both [16] and [35]. Eckstein [13] also provides a good overview of the implementation of parallel branch and bound. A substantial number of papers have been written speci cally about the application of parallel branch and bound to discrete optimization problems, including [5, 9, 17, 24, 37] 6 3 Overview of ....
H. W. J. M. Trienekens and A. de Bruin, Towards a Taxonomy of Parallel Branch and Bound Algorithms, Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam (1992).
Synchronous Tabu Search Parallelization Strategies for.. - Crainic, al. (1995) (1 citation) (Correct)
....space. Generally, this extra efficiency may be achieved by accelerating some particularly tedious computational phases of the algorithm, or by redesigning parts of the algorithm, or by performing several searches simultaneously. In the context of branch and bound algorithms, Trienekens and Bruin [19] refer to the first two approaches as low and high level parallelization, respectively, because a low level parallel implementation of an algorithm does not change the interactions between its various parts; hence, it is not intrinsically different from its sequential version, only faster. In this ....
H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam, 1992.
Parallel Asynchronous Tabu Search for Multicommodity.. - Crainic, Toulouse, al. (1994) (1 citation) (Correct)
....Generally, this additional efficiency may be achieved by accelerating some particularly tedious computational phases of the algorithm, by redesigning parts of the algorithm to take advantage of the parallel architecture, or by performing several searches simultaneously. One usually refers (e.g. [18] in the context of branch and bound algorithms) to the first two approaches as low and high level parallelization, respectively, because a low level parallel implementation of an algorithm does not change the interactions between its various parts; hence, it is not intrinsically different from its ....
H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam, 1992. 28
Towards a Taxonomy of Parallel Tabu Search Heuristics - Crainic, Toulouse, al. (1995) (8 citations) (Correct)
....design procedures that explore more efficiently the solution space. Generally, this extra efficiency may be achieved by accelerating some particularly tedious computational phases of the algorithm, or by redesigning the algorithm. In the context of branch and bound algorithms, Trienekens and Bruin [27] refer to these approaches as low and high level parallelization, respectively, because a low level parallel implementation of an algorithm does not change the interactions between its various parts; hence, it is not intrinsically different from its sequential version, only faster. In the context ....
....master collects and reconciliates the information, distributes the tasks to be executed by the other processors, and determines when the search has to stop. The tasks that are delegated may consist of only time consuming numerical computations; this corresponds to what Trienekens and de Bruin [27] call low level parallelism in the branch and bound context. It may also imply, however, the parallel exploration of the neighbourhood [3, 5] or the construction and evaluation of the candidate list. A straightforward implementation of the sequential fan candidate list strategy [19] falls under ....
H.W.J.M. Trienekens and A. de Bruin. Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam, 1992.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC