An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs.
Sanjeeb DashPublished in: IPCO (2002)
Keyphrases
- lower bound
- upper bound
- objective function
- branch and bound algorithm
- worst case
- lower and upper bounds
- branch and bound
- average case complexity
- theorem prover
- class labels
- data sets
- optimal solution
- theorem proving
- neural network
- genetic algorithm
- average case
- lower bounding
- sufficiently accurate
- mathematical proofs