Algorithms for limited-buffer shortest path problems in communication-restricted environments.
Alessandro RivaJacopo BanfiArlind RufiFrancesco AmigoniPublished in: ECMR (2017)
Keyphrases
- shortest path problem
- computational complexity
- combinatorial optimization problems
- orders of magnitude
- theoretical analysis
- computationally efficient
- optimization algorithm
- neural network
- optimization problems
- computational cost
- significant improvement
- bayesian networks
- information sharing
- times faster
- combinatorial optimization
- machine learning
- real world