The probabilistic 1-maximal covering problem on a network with discrete demand weights.
Oded BermanJ. WangPublished in: J. Oper. Res. Soc. (2008)
Keyphrases
- wireless sensor networks
- relative importance
- bandwidth requirements
- hopfield neural network
- finite number
- unstructured peer to peer
- hidden nodes
- distribution network
- weighted sum
- network architecture
- network model
- complex networks
- linear combination
- peer to peer
- bayesian networks
- communication networks
- network traffic
- generative model
- connection weights
- continuous valued
- artificial neural networks
- optimal solution