|
From: | Michael Hennebry |
Subject: | Re: [Help-glpk] Continuing search after time-out |
Date: | Thu, 4 Feb 2010 09:58:30 -0600 (CST) |
User-agent: | Alpine 1.00 (DEB 882 2007-12-20) |
On Thu, 4 Feb 2010, Pavel Klinov wrote:
If B&C search gets interrupted due to time-out and but then is run again, does it start from scratch or is it able to continue from where it stopped? Is there a way for it to store all the internal data structures and continue? Basically I want GLPK MIP solver to give me the first "acceptable" solution because sometimes it spends a lot of time searching "near" the optimal one (as far as I see in the output). I guess the easiest
IIRC there is a parameter that tells GLPK how much improvement is worth any effort. -- Michael address@hidden "Pessimist: The glass is half empty. Optimist: The glass is half full. Engineer: The glass is twice as big as it needs to be."
[Prev in Thread] | Current Thread | [Next in Thread] |