B. Mans. Contribution `a l'Algorithmique Non Num'erique Parall`ele : Parall'elisation de M'ethodes de Recherche Arborescente. PhD thesis, Universit'e Paris VI, June 1992. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Parallel Best-First Branch-and-Bound in Discrete.. - Correa, Ferreira (1995) (3 citations) (Correct)
....are presented in section 7. A large number of references is provided. 2 Preliminaries on sequential B B A sequential B B algorithm consists of a sequence of iterations, in which some operators are applied over a data structure D. This data structure keeps a priority list of subproblems [8, 40]. These operators choose a subproblem from D, decompose it and eventually insert new subproblems into the data structure, chosen among those generated by the decomposition. Feasible solutions are found during the search in two situations. First, a decomposition may generate subproblems simple ....
....solution of S in v (not necessarily the best solution of v) The best feasible solution found so far is kept, as well as its value. At some points of the execution, some subproblems shown not to contain a feasible solution better than the current best known feasible solution are eliminated [11, 18, 23, 24, 40, 42, 57]. We call open subproblems 9 the subproblems that contain a feasible solution and that, at any point of the execution, were generated but neither decomposed nor eliminated. At each iteration, the data structure D is composed of a collection of open subproblems, called 9 Or live nodes [30] ....
[Article contains additional citation context not shown here]
B. Mans. Contribution `a l'Algorithmique Non Num'erique Parall`ele : Parall'elisation de M'ethodes de Recherche Arborescente. PhD thesis, Universit'e Paris VI, June 1992.
R'egulation Dynamique de la Charge pour le B & B: Théorie et .. - Benaïchouche (1995) Self-citation (Parall) (Correct)
....oeuvre du fait de l acc es direct a tous les noeuds en attente dans une liste partag ee, par tous les processeurs. N eanmoins, une structure de donn ees bien adapt ee doit etre introduite pour bien g erer l acc es concurrent des processeurs. Dans ce cadre on cite le travail int eressant de Le Cun [BC92, Man92], dont une multitude de structure de donn ees concurrentes ont et e propos ees et mises en oeuvres. En revanche dans l approche distribu ee qui nous int eresse, nous constatons que la majorit e des etudes faites furent orient ees vers deux principaux objectifs. ffl la r egulation de la charge ....
B. Mans. Contribution ` A l'Algorithmique Non Num'erique Parall`ele: Parall 'elisation de M'ethodes de Recherche Arborescentes. PhD thesis, Universit'e Pierre et Marie Curie, Paris, Juin 1992.
BOB : a Unified Platform for Implementing Branch-and-Bound.. - Le Cun, Team (1995) (8 citations) Self-citation (Parall) (Correct)
.... : 17 8 Conclusion and perspectives 17 Laboratoire PRiSM II PNN team Laboratoire PRiSM BOB : a Unified Platform for Implementing Branch and Bound like Algorithms 1 1 The need for a Branch and Bound library All Branch and Bound applications use the same components [4, 15, 19, 22, 26, 28, 29, 33]. When someone writes Branch and Bound algorithms to resolve real life problems, often he rewrites (implements) these components : Management of the priority queue, management of the upper bound, etc. He can not concentrate his work for the essential parts of the application (generation, ....
Mans (B.). -- Contribution `a l'Algorithmique Non Num'erique Parall`ele : Parall 'elisation de M'ethodes de Recherche Arborescente. -- Th`ese de doctorat, Universit'e Paris 6, Juin 1992.
A Parallel Depth First Search Branch and Bound Algorithm.. - Mans, Mautor, Roucairol (1994) Self-citation (Mans) (Correct)
....algorithm on an asynchronous shared memory multiprocessor, the Cray 2. Our main concern has been to minimize the waiting time (inactivity) of the processors and, thus, to obtain the highest speed up. Thus, our approach considers the major difficulties appearing in parallelizing B B methods [14] : task allocation, choice of granularity, overhead detection, As previously argued, we use a depth first search strategy. In a parallel implementation, an additional reason appears, since the granularity (relative number of operations done between synchronizations) defined by a parallel best ....
B. Mans. Contribution `a l'Algorithmique Non Num'erique Parall`ele : Parall'elisations de M'ethodes de Recherche Arborescentes. Th`ese d'universit'e, Universit'e Paris VI, 4, place Jussieu, 75252 Paris Cedex 05, June 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