Hi Andrew,
A few weeks ago you wrote:
I'd like to note that sometimes '--cuts' is not a best choice.
>
I did an experiment regarding this. In particular, I tried 84 out of the 87
problems in the miplib 2010 benchmark set (the other 3 needed more than an
hour to solve the root relaxation). I
Hi Andrew,
I'd like to note that sometimes '--cuts' is not a best choice. For
> example, air04 and air05 (hard set partitioning problems) from miplib
> 3.0 are solved quickly (about 10 mins on my machine) with '--pcost',
> but with cutting planes the solution takes more 6 hours. Probably this
>
Hi Chris,
> In order to test the release, I tried the 2010 MIPLIB benchmark set,
> calling glpsol with "--pcost --cuts" and a two hour time limit. The
> final result is in the attached file, but the quick summary is that 20
> problems from this set were solved, while there were three aborts.