On inverse linear programming problems under the bottleneck-type weighted Hamming distance.
Javad TayyebiMassoud AmanPublished in: Discret. Appl. Math. (2018)
Keyphrases
- hamming distance
- linear programming problems
- linear programming
- primal dual
- linear program
- binary strings
- multiple objectives
- column generation
- pattern matching
- mixed integer
- interior point methods
- optimal solution
- distance measure
- binary codes
- edit distance
- optimization problems
- simplex method
- computational complexity
- hash functions
- bayesian networks