I am writing a timetabling program in GMPL and I #39;d like to
write some incompatibility constraints of courses generally, e.g. I
want to say that no more than 1 of {A1, A2, A3} can appear in the same
slot, and no more than 1 of {B1, B2} can appear in the same slot
something like..
set
I generated glpsol.exe 4.2.8 using Microsoft Visual Studio 2005. It did
not stop after over 10 hours when manna81.mps of MIPLIB 2003 was being
solved. However COIN_OR could solve manna81.mps in less than 10
seconds.
Will any please tell me what happened. Thanks.
