[Coin-discuss] PhD student sought.

[David Bremner]

Hi All;

I hope job ads are not off-topic here.  

P.S. I can see this will probably make Ted Ralphs curious. :) It is not
too clear to me yet to what extent this project will re-use code from
CHiPPS, but as you can probably tell from the terminology it is inspired
in part by that project (and of course other coin-or projects like
Symphony and BCP). We'll certainly be re-using to the extent that it
makes sense and giving back to the extent that it is possible.

----------------------------------------------------------------------

Candidates are sought for a 3 year funded Ph.D. student position
(subject to availability of funds, 1 year with renewal subject to
satisfactory performance and further availability of funds).  The
position is to start September 1 2010, or as soon as possible
afterwards.

The selected candidate will design, implement, and experimentally
evaluate an open source framework for /parallel tree search/. Tree
search applications such as /SAT/ and /integer programming/ are
characterized by their use of divide-and-conquer to find a solution,
and by the use of a shared knowledge pool to accelerate the search.

Candidates should have a Master's degree in Computer Science or
equivalent. We are particularly interested in candidates with
background in one or more of the following:

- High Performance Computing
- Parallel Programming, particularly distributed memory models.
- SAT solvers
- Discrete Optimization
- Linux/Unix Systems Programming
- Batch systems and cluster computing

Candidates are encouraged to contact 

    David Bremner <bremner at unb.ca>

with a resumé and unofficial post-secondary transcripts.