LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap.
John MartinovicGuntram ScheithauerPublished in: OR (2015)
Keyphrases
- upper bound
- lower bound
- linear programming
- upper bounding
- optimal solution
- np hard
- upper and lower bounds
- tight bounds
- branch and bound algorithm
- branch and bound
- stock market
- improved algorithm
- worst case
- linear program
- lower and upper bounds
- generalization error
- sample size
- sample complexity
- constant factor
- tight upper and lower bounds
- neural network
- lower bounding
- linear programming relaxation
- stock price
- objective function