|Subject:||Re: [Help-glpk] testing glpk 4.62 on a 64-bit platform|
|Date:||Wed, 24 May 2017 16:47:51 -0400|
I’ll try to test it on my OS X platform later. I have a question: suppose the same problem can be formulated as both a SAT or a 0-1 integer program. Which can be solved faster in general?
|[Prev in Thread]||Current Thread||[Next in Thread]|