[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
RE: [Help-glpk] shiftcover.mod - generate different solutions
From: |
Andreas F |
Subject: |
RE: [Help-glpk] shiftcover.mod - generate different solutions |
Date: |
Fri, 18 Feb 2011 12:49:53 +0000 |
> From: address@hidden
> On Wed, 2011-02-16 at 14:48 +0000, Andreas F wrote:
> > However, is it possible to generate multiple, different solutions [..] ?
> >
> Currently glpk does not have such a feature. However, you may obtain an
> alternate mip solution by introducing a packing inequality to disable
> the current optimal solution. See
> http://lists.gnu.org/archive/html/help-glpk/2010-02/msg00033.html
> for example.
The solution is indeed elegant, but it requires use of files and one has to
re-run the solver. Is it possible to generate more than one solution without
using files?
Best regards,
Andreas
--
if (typeof(lpcurruser) == 'undefined') lpcurruser = ''; if
(document.getElementById('lpcurruserelt') &&
document.getElementById('lpcurruserelt').value != '') { lpcurruser =
document.getElementById('lpcurruserelt').value;
document.getElementById('lpcurruserelt').value = ''; } if (typeof(lpcurrpass)
== 'undefined') lpcurrpass=''; if (document.getElementById('lpcurrpasselt') &&
document.getElementById('lpcurrpasselt').value != '') { lpcurrpass =
document.getElementById('lpcurrpasselt').value;
document.getElementById('lpcurrpasselt').value = ''; } var lploc=2;var
lponlyfill=null;var link=document.getElementById("i1668");
if(link&&typeof(g_lpclicked)=="undefined"){if(document.createEventObject){var
evt = document.createEventObject();link.fireEvent("onclick",evt);}else{var evt2
= document.createEvent("MouseEvents");evt2.initMouseEvent("click", true, true,
document.defaultView, 1, 0, 0, 0, 0, false, false, false, false, 0,
null);link.dispatchEvent(evt2);}g_lpclicked=1;}lpcurruser = ''; lpcurrpass =
'';if (typeof(lpcurruser) == 'undefined') lpcurruser = ''; if
(document.getElementById('lpcurruserelt') &&
document.getElementById('lpcurruserelt').value != '') { lpcurruser =
document.getElementById('lpcurruserelt').value;
document.getElementById('lpcurruserelt').value = ''; } if (typeof(lpcurrpass)
== 'undefined') lpcurrpass=''; if (document.getElementById('lpcurrpasselt') &&
document.getElementById('lpcurrpasselt').value != '') { lpcurrpass =
document.getElementById('lpcurrpasselt').value;
document.getElementById('lpcurrpasselt').value = ''; } var lploc=1;var
lponlyfill=null;var link=document.getElementById("i1668");
if(link&&typeof(g_lpclicked)=="undefined"){if(document.createEventObject){var
evt = document.createEventObject();link.fireEvent("onclick",evt);}else{var evt2
= document.createEvent("MouseEvents");evt2.initMouseEvent("click", true, true,
document.defaultView, 1, 0, 0, 0, 0, false, false, false, false, 0,
null);link.dispatchEvent(evt2);}g_lpclicked=1;}lpcurruser = ''; lpcurrpass =
'';if (typeof(lpcurruser) == 'undefined') lpcurruser = ''; if
(document.getElementById('lpcurruserelt') &&
document.getElementById('lpcurruserelt').value != '') { lpcurruser =
document.getElementById('lpcurruserelt').value;
document.getElementById('lpcurruserelt').value = ''; } if (typeof(lpcurrpass)
== 'undefined') lpcurrpass=''; if (document.getElementById('lpcurrpasselt') &&
document.getElementById('lpcurrpasselt').value != '') { lpcurrpass =
document.getElementById('lpcurrpasselt').value;
document.getElementById('lpcurrpasselt').value = ''; } var lploc=1;var
lponlyfill=null;var link=document.getElementById("i1668");
if(link&&typeof(g_lpclicked)=="undefined"){if(document.createEventObject){var
evt = document.createEventObject();link.fireEvent("onclick",evt);}else{var evt2
= document.createEvent("MouseEvents");evt2.initMouseEvent("click", true, true,
document.defaultView, 1, 0, 0, 0, 0, false, false, false, false, 0,
null);link.dispatchEvent(evt2);}g_lpclicked=1;}lpcurruser = ''; lpcurrpass =
'';