help-glpk
[Top][All Lists]
Advanced

[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: [Help-glpk] Help regarding MILP problem


From: Andrew Makhorin
Subject: Re: [Help-glpk] Help regarding MILP problem
Date: Fri, 1 Dec 2006 08:24:58 +0300

> This was a relatively smaller instance. When I perform the same
> thing on a bigger instance ( problem file attached), using --intopt,
> it takes quite a long time. Could you suggest any other enhancements
> in the way I can run it to furthur optimize it ?

Your instance is hard for glpk due to its size as well as due to the
problem class, because scheduling problems are most difficult ones in
combinatorial optimization.

You might consider using other optimization packages (like scip or
coin; they both are open source) or, if a suboptimal solution is
enough, appropriate heuristic algorithms.

> Also, I am repeating the same question. Do you think employing LP
> relaxation first and then coming up with the MIP solution using
> branch and bound tree approach can be of help? Does glpk have any
> support for that where I can get a faster solution while
> compromising only a little amount of quality?

No, glpk does not have such a feature.





reply via email to

[Prev in Thread] Current Thread [Next in Thread]