[Lemon-user] Method used by GlpkMip

[Leon Stroh]

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 assum 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 99
leon.stroh at hacon.de
http://www.hacon.de

Office/Sitz: Hannover, Registry Court/Amtsgericht: Hannover HRB 1712
Managing Directors/Geschäftsführer:
Michael Frankenberg, Werner Sommerfeld, Peter Talke