New lower bounds for permutation arrays using contraction.
Sergey BeregZevi MillerLuis Gerardo MojicaLinda MoralesIvan Hal SudboroughPublished in: Des. Codes Cryptogr. (2019)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- np hard
- belief change
- objective function
- optimal solution
- upper and lower bounds
- quadratic assignment problem
- lower and upper bounds
- vc dimension
- lower bounding
- worst case
- linear array
- greedy algorithm
- lagrangian relaxation
- max sat
- sample size
- randomly generated problems
- doubly stochastic