메뉴 건너뛰기




Volumn 230, Issue 2, 2013, Pages 226-230

Finding hypernetworks in directed hypergraphs

Author keywords

Graph theory Directed hypergraphs Hyperpaths

Indexed keywords

DIRECTED HYPERGRAPHS; FAST ALGORITHMS; HARD PROBLEMS; HYPERGRAPH MODEL; HYPERNETWORK; LOGICAL STRUCTURE; POINT OF VIEWS; POLYNOMIALLY SOLVABLE;

EID: 84878935591     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2013.04.020     Document Type: Article
Times cited : (13)

References (10)
  • 7
    • 33748421291 scopus 로고    scopus 로고
    • Finding the K best policies in a finite-horizon Markov decision process
    • L.R. Nielsen, and A.R. Kristensen Finding the K best policies in a finite-horizon Markov decision process European Journal of Operational Research 175 2 2006 1164 1179
    • (2006) European Journal of Operational Research , vol.175 , Issue.2 , pp. 1164-1179
    • Nielsen, L.R.1    Kristensen, A.R.2
  • 8
    • 0033894213 scopus 로고    scopus 로고
    • A directed hypergraph model for random time-dependent shortest paths
    • D. Pretolani A directed hypergraph model for random time-dependent shortest paths European Journal of Operational Research 123 2 2000 315 324
    • (2000) European Journal of Operational Research , vol.123 , Issue.2 , pp. 315-324
    • Pretolani, D.1
  • 9
    • 64949147244 scopus 로고    scopus 로고
    • Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks
    • D. Pretolani, L.R. Nielsen, K.A. Andersen, and M. Ehrgott Time-adaptive and history-adaptive multicriterion routing in stochastic, time-dependent networks Operations Research Letters 37 2009 201 205
    • (2009) Operations Research Letters , vol.37 , pp. 201-205
    • Pretolani, D.1    Nielsen, L.R.2    Andersen, K.A.3    Ehrgott, M.4


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.