Capacitated Arc Routing Problem over Sparse Underlying Graph under Travel Costs Uncertainty.
Sara TfailiAbdelkader SbihiAdnan YassineIbrahima DiarrassoubaPublished in: ICORES (2018)
Keyphrases
- graph representation
- graph structure
- directed acyclic
- lower bound
- random walk
- travel cost
- directed graph
- total cost
- gaussian graphical models
- graph model
- directed acyclic graph
- uncertain data
- connected components
- graph theory
- bayesian networks
- routing problem
- decision theory
- sparse data
- elastic net
- structured data
- weighted graph
- graph matching
- sparse coding
- memetic algorithm
- compressive sensing
- probability measure
- missing data
- optimal solution