Login / Signup

A Weighted Inverse Minimum s - t Cut Problem with Value Constraint Under the Bottleneck-Type Hamming Distance.

Elham Ramzani GhalebalaMassoud AmanNasim Nasrabadi
Published in: Asia Pac. J. Oper. Res. (2024)
Keyphrases
  • hamming distance
  • distance measure
  • binary strings
  • binary codes
  • pattern matching
  • binary representation
  • neural network
  • data sets
  • dynamic programming
  • machine learning
  • data structure