[SciPy-Dev] support for solving integer programming problems

Jeffrey Manville jeffmanvillejr at gmail.com
Fri Oct 6 13:04:03 EDT 2017


I would also be interested in contributing to this. I have some classwork
experience with IP and at the least would enjoy contributing more testing.

Jeff

>I am.
>
>On Thu, Oct 5, 2017 at 12:01 PM, Matt Haberland <haberland at ucla.edu> wrote:
>
>> Yes. I wrote the new interior point method for linprog because the
>> existing simplex implementation was having trouble with relaxed LPs from
my
>> (branch and bound) binary integer LP solver. The BILP solver is basically
>> ready for a PR, but some suggested that I should shoot for a full mixed
>> integer LP solver before submitting. I did plan to work on this. You
>> interested, Phillip?
>>
>> Matt
>>
>>
>>
>> On Sep 29, 2017 8:32 PM, "Phillip Feldman" <phillip.m.feldman at gmail.com>
>> wrote:
>>
>> I'm wondering whether anyone has been thinking of adding capability to
>> `scipy.optimize` for solving low-dimensionality integer programming
>> problems.  In particular, I'm thinking of such methods as local search or
>> tabu search.
>>
>>
>> Phillip
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://mail.python.org/pipermail/scipy-dev/attachments/20171006/49ffd70a/attachment.html>


More information about the SciPy-Dev mailing list