|
| From: | Andrew Makhorin |
| Subject: | Re: [Help-glpk] testing glpk 4.62 on a 64-bit platform |
| Date: | Thu, 25 May 2017 08:29:06 +0300 |
> 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? > Impossible to say--it essentially depends on particular properties of the instance.
| [Prev in Thread] | Current Thread | [Next in Thread] |