[Help-glpk] [Fwd: Re: Faster Integer-Feasibility in Mixed-Integer Linear Programs by Branching to Force Change]

[Andrew Makhorin]

-------- Forwarded Message --------
From: John Chinneck <address@hidden>
To: Noli Sicad <address@hidden>
Cc: Andrew Makhorin <address@hidden>, address@hidden
<address@hidden>, Jennie Pryor <address@hidden>
Subject: Re: Faster Integer-Feasibility in Mixed-Integer Linear Programs
by Branching to Force Change
Date: Sun, 26 Feb 2012 16:54:16 -0500

Hi there:

Jennie Pryor developed the code described in the paper as part of her
master's thesis in Systems and Computer Engineering at Carleton
University.  I've been in touch with her and she is happy to donate the
code that she developed, as is.  You will likely have to make some
adjustments to make her code work correctly with the lastest version of
GLPK.  I'd also recommend that you remove the code for the less successful
methods that were part of her research.

Let me know if you plan on moving ahead with this and I will send along
the code.

    John

> Hi Andrew,
>
> Have you seen this publication (below link)? It is using GPLK 4.28 as
> base code, if I may not mistaken.
>
> Faster Integer-Feasibility in Mixed-Integer Linear Programs by
> Branching to Force Change
> http://www.sce.carleton.ca/faculty/chinneck/docs/PryorChinneck.pdf
> 22 Oct 2010 – Faster Integer-Feasibility in Mixed-Integer Linear
> Programs by Branching to Force Change. by Jennifer Pryor
> (address@hidden). John W. Chinneck
>
> What do you think about this algorithm?
>
> Can we integrate this in the GLPK as one of the options to speed up IP
> solution?
>
> What do others think about this algorithm?
>
> Probably, we can ask the authors if they like to contribute the code
> to GLPK/MathProg project?
>
> Thanks.
>
> Noli