Exact capacitated domination: On the computational complexity of uniqueness.
Gregory Z. GutinPhilip R. NearyAnders YeoPublished in: Discret. Appl. Math. (2023)
Keyphrases
- computational complexity
- np hard
- facility location
- special case
- high computational complexity
- lot sizing
- low complexity
- multi item
- approximation algorithms
- sufficient conditions
- computationally efficient
- memory requirements
- decision problems
- single source
- network design problem
- storage requirements
- integer programming
- facility location problem
- multi commodity
- np complete
- computational cost
- video sequences
- multi period
- databases
- rate distortion
- data fusion
- shortest path
- linear programming
- motion estimation
- lower bound
- neural network
- production inventory