Depth lower bounds in Stabbing Planes for combinatorial principles.
Stefan S. DantchevNicola GalesiAbdul GhaniBarnaby MartinPublished in: Electron. Colloquium Comput. Complex. (2021)
Keyphrases
- lower bound
- upper bound
- branch and bound
- branch and bound algorithm
- objective function
- np hard
- depth map
- three dimensional
- linear programming relaxation
- quadratic assignment problem
- depth information
- lower and upper bounds
- lower bounding
- d objects
- worst case
- optimal solution
- piecewise planar
- upper and lower bounds
- randomly generated problems