An IP-based swapping algorithm for the metric dimension and minimal doubly resolving set problems in hypercubes.
Alain HertzPublished in: Optim. Lett. (2020)
Keyphrases
- benchmark problems
- search space
- np hard
- dynamic programming
- learning algorithm
- k means
- cost function
- initial set
- distance metric
- expectation maximization
- optimization algorithm
- matching algorithm
- polynomial time complexity
- packing problem
- distance function
- detection algorithm
- worst case
- probabilistic model
- lower and upper bounds
- computational complexity
- optimal solution
- iterative algorithms
- input pattern
- similarity measure