[Coin-bcpdiscuss] CUP running time & Cuts

[Peter Hwang]

Hi, I am doing research on Branch-and-Cut-and-Price.

I just finished implementing cut generation, and it generates one cut in
each iteration.
I want to see how many cuts are generated and how long it takes to get the
optimal solution within a time limit.
BCP_MaxRunTime is 36000.
Though I have run the code for several examples, it doesn't go until 36000
sec. and usually is done far earlier (less than 20000sec) saying "TM: Time
has ran out."
And the number of generated cuts was 10001, 20001, 30001, ...
I wonder why this happened.

Is Default number of generated cuts (within branch and bound iterations)
multiples of 10000?
Dose COIN/BCP finish whenever it founds that the computational cost is too
high?

Thanks in advance.

Peter.