如何选择一个整数线性规划求解? [英] How to choose an integer linear programming solver?
问题描述
我是新手的整数线性规划。 我打算使用一个整数线性规划求解来解决我的组合优化问题。 我比较熟悉的一个IDE C ++ /面向对象编程。 现在我使用NetBeans与Cygwin来写我的应用程序的大部分时间。
I am newbie for integer linear programming. I plan to use a integer linear programming solver to solve my combinatorial optimization problem. I am more familiar with C++/object oriented programming on an IDE. Now I am using NetBeans with Cygwin to write my applications most of time.
请问是否有一个简单的使用ILP求解给我吗? 或者,这取决于我想要解决这个问题?我试图做一些资源映射优化。请让我知道是否需要任何进一步的信息。
May I ask if there is an easy use ILP solver for me? Or it depends on the problem I want to solve ? I am trying to do some resources mapping optimization. Please let me know if any further information is required.
非常感谢你,卡西。
推荐答案
如果你想要的是线性混合整数规划,那么我会指向投币式或(和专门的模块CBC)。它是免费软件(如语音) 您可以使用它与特定的语言,或使用C ++。
If what you want is linear mixed integer programming, then I would point to Coin-OR (and specifically to the module CBC). It's Free software (as speech) You can either use it with a specific language, or use C++.
使用C ++,如果你的数据需要大量的preprocessing,或者如果你想要把你的手到解算器(选择枢轴点,列生成,增加切割等...)。
Use C++ if you data requires lots of preprocessing, or if you want to put your hands into the solver (choosing pivot points, column generation, adding cuts and so on...).
如果你想使用的求解器作为一个黑盒子(你在结果只是有兴趣,问题是容易还是够经典不调整来解决),使用集成的语言。
Use the integrated language if you want to use the solver as a black box (you're just interested in the result and the problem is easy or classic enough to be solved without tweaking).
但在标记你提到的遗传算法和图形算法。也许你应该更好地开始defing您的问题... 对于图我想了很多的boost ::图
But in the tags you mention genetic algorithms and graphs algorithms. Maybe you should start by better defing your problem... For graphs I like a lot Boost::Graph
这篇关于如何选择一个整数线性规划求解?的文章就介绍到这了,希望我们推荐的答案对大家有所帮助,也希望大家多多支持IT屋!