A Lower Bound on the Growth Constant of Polyaboloes on the Tetrakis Lattice.
Gill BarequetMinati DePublished in: COCOON (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- optimal solution
- constant factor
- objective function
- upper and lower bounds
- np hard
- worst case
- lower and upper bounds
- lower bounding
- arbitrarily close
- growth rate
- neural network
- linear programming relaxation
- e learning
- lattice structure
- growth model
- polynomial approximation
- sufficiently accurate