Hi,

it's uses the glp_intopt function, which is a branch-and-cut solver. You
can check it in the glpk documentation:
http://www.math.uiuc.edu/~stolee/482/glpk.pdf

Balazs



On Tue, Mar 19, 2013 at 10:26 AM, Leon Stroh <leon.st...@hacon.de> wrote:

>
> Hello,
>
> someone out there?
>
> -------- Original-Nachricht --------  Betreff: [Lemon-user] Method used
> by GlpkMip  Datum: Fri, 15 Mar 2013 08:41:32 +0100  Von: Leon Stroh
> <leon.st...@hacon.de> <leon.st...@hacon.de>  An:
> lemon-user@lemon.cs.elte.hu
>
> Hi,
>
> I'm using GlpkMip to solve a large scale combinatorial problem. It works
> good for me right now. However, I could not find any indication in the
> lemon as well as in the Glpk documentation of which solver Glpk is
> actually using to solve the problem. I assume that it could be Branch &
> Bound with Simplex. Is there any way to tell Glpk which method to use
> through the lemon GlpkMip interface?
>
> I'm working on my Master thesis and I need to know at least which method
> is being used for an analysis.
>
> Regards,
>
> Leon
>
> --
> Leon Stroh
>
> HaCon Ingenieurgesellschaft mbH
> Lister Str. 15
> D-30163 Hannover
> Germany
>
> T: +49 511 33699 436
>
> F: +49 511 33699 99leon.stroh@hacon.dehttp://www.hacon.de
>
> Office/Sitz: Hannover, Registry Court/Amtsgericht: Hannover HRB 1712
> Managing Directors/Geschäftsführer:
> Michael Frankenberg, Werner Sommerfeld, Peter Talke
>
> _______________________________________________
> Lemon-user mailing 
> listlemon-u...@lemon.cs.elte.huhttp://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>
>
>
>
>
> _______________________________________________
> Lemon-user mailing list
> Lemon-user@lemon.cs.elte.hu
> http://lemon.cs.elte.hu/mailman/listinfo/lemon-user
>
>
_______________________________________________
Lemon-user mailing list
Lemon-user@lemon.cs.elte.hu
http://lemon.cs.elte.hu/mailman/listinfo/lemon-user

Reply via email to