Login / Signup

A geometric approach to finding new lower bounds of A(n, d, w).

Igor GashkovJ. A. O. EkbergD. Taub
Published in: Des. Codes Cryptogr. (2007)
Keyphrases
  • lower bound
  • upper bound
  • branch and bound algorithm
  • data sets
  • worst case
  • branch and bound
  • search engine
  • objective function
  • np hard
  • quadratic assignment problem
  • randomly generated problems