Concurrent data structures and load balancing
                    strategies for parallel branch-and-bound/A*
                    algorithms

Cung, Van‐Dat; Dowaji, Salah; Cun, Bertrand Le; Mautor, Thierry; Roucairol, Catherine

doi:10.1090/dimacs/030/09

Cited by 10 publications

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The BOB library (Cung et al, 1997;Le Cun, Roucairol and TNN Team, 1995) is generally applied to facilitate the development of the branch-and-bound applications (min/max problems). This library has the double goal of allowing on the one hand the operational research and arti®cial intelligence communities (i) to implement their applications without worrying about the architecture of available machines and (ii) bene®ting the advantages provided by the sequential and parallel approaches.…”

Section: The Bob Librarymentioning

confidence: 99%

Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm

Cung

2000

International Transactions in Operational Research

Self Cite

View full text Add to dashboard Cite

In this paper, we develop a new version of the algorithm proposed in Hi® (Computers and Operations Research 24/8 (1997) 727±736) for solving exactly some variants of (un)weighted constrained twodimensional cutting stock problems. Performance of branch-and-bound procedure depends highly on particular implementation of that algorithm. Programs of this kind are often accelerated drastically by employing sophisticated techniques. In the new version of the algorithm, we start by enhancing the initial lower bound to limit initially the space search. This initial lower bound has already been used in Fayard et al. 1998 (Journal of the Operational Research Society, 49, 1270±1277), as a heuristic for solving the constrained and unconstrained cutting stock problems. Also, we try to improve the upper bound at each internal node of the developed tree, by applying some simple and ecient combinations. Finally, we introduce some new symmetric-strategies used for neglecting some unnecessary duplicate patterns. The performance of our algorithm is evaluated on some problem instances of the literature and other hard-randomly generated problem instances. 7 (M. Hi®). J (NV-pattern but not a NH-pattern) horizontal combination of the patterns A and

show abstract

Section: The Bob Librarymentioning

confidence: 99%