An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs
Mathematics of Operations Research
Hi-index | 0.00 |