Exact capacitated domination: on the computational complexity of uniqueness.
Gregory Z. GutinPhilip R. NearyAnders YeoPublished in: CoRR (2020)
Keyphrases
- computational complexity
- np hard
- np complete
- special case
- computational cost
- routing problem
- lot sizing
- single source
- low complexity
- exact solution
- computational efficiency
- data sets
- multi source
- storage requirements
- memory requirements
- multi item
- lower bound
- high computational complexity
- network design problem
- capacity constraints
- explanatory power
- vehicle routing problem
- decision problems
- data fusion
- sufficient conditions
- optimal solution
- case study