Perregaard Michael

Michael Perregaard

Information about the author Michael Perregaard will soon be added to the site.
Found 4 papers in total
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
On the best search strategy in parallel branch-and-bound: Best-first search versus lazy depth-first search
1999
The Best-First Search strategy (BeFS) and the Depth-First Search strategy (DFS) are...
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
On the applicability of lower bounds for solving rectilinear quadratic assignment problems in parallel
1998
The quadratic assignment problem (QAP) belongs to the hard core of NP-hard...
Parallel branch-and-bound methods for the job-shop scheduling problem
Parallel branch-and-bound methods for the job-shop scheduling problem
1998
Job-Shop Scheduling (JSS) problems are among the more difficult to solve in the class...
Solving large quadratic assignment problems in parallel
Solving large quadratic assignment problems in parallel
1997
Quadratic Assignment (QAPs)problems are in practice among the most difficult to solve...
Papers per page: