[CHiPPS] Advice for implementing a parallel MINLP using BB tree search

[Yan Xu]

If the NLP relaxation of the MINLP is convex, you can use what you described to write a basic MINLP solver. To make it efficient, may need write many code. Here is a website collecting some information about MINLP

http://www.gamsworld.org/minlp/solvers.htm

Hopes this helps.
-Yan Xu

From: chipps-bounces at list.coin-or.org [mailto:chipps-bounces at list.coin-or.org] On Behalf Of ??
Sent: 2012年5月23日 3:02 上午
To: chipps at list.coin-or.org
Subject: [CHiPPS] Advice for implementing a parallel MINLP using BB tree search

Dear professors,
   I have just started to learn chipps. And I found that BLIS is programmed to solve MILP in parallel. According to my understanding, in order to build a parallel MINLP solver I just need to change lp solver to NLP solver without modifying the source code of Alps and Bcps. Am I correct?
  From where should I start first to implement a parallel MINLP solver using chipps?
   Thanks!
Zhou Kai

-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://list.coin-or.org/pipermail/chipps/attachments/20120526/7c21f7c0/attachment.html>