SCOPUS 정보 검색 플랫폼

Computers and Operations Research

Volumn 31, Issue 10, 2004, Pages 1667-1680

An exact algorithm for the robust shortest path problem with interval data

(2) Montemanni, R a Gambardella, L M a

a DALLE MOLLE INSTITUTE FOR ARTIFICIAL INTELLIGENCE IDSIA (Switzerland)

Author keywords

Interval data; Robust optimization; Shortest path problem

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; COMPUTER NETWORKS; COMPUTERS; DATA REDUCTION; HEURISTIC METHODS; MATHEMATICAL TECHNIQUES; OPERATIONS RESEARCH; ROBUSTNESS (CONTROL SYSTEMS);

ROBUST SHORTEST PATH;

PROBLEM SOLVING;

ALGORITHM;

EID: 1842843696 PISSN: 03050548 EISSN: None Source Type: Journal
DOI: 10.1016/S0305-0548(03)00114-X Document Type: Article

Times cited : (99)

References (10)

1
- 0032093911
- On the shortest path problem
- Yu G. Yang J. On the shortest path problem Computers and Operations Research 25 6 1988 457-468
- (1988) Computers and Operations Research , vol.25 , Issue.6 , pp. 457-468
- Yu, G.¹ Yang, J.²

2
- 0343081537
- Shortest path problems with partial information: Models and algorithms for detecting dominance
- Dias L.C. Cĺmaco J.N. Shortest path problems with partial information: models and algorithms for detecting dominance European Journal of Operational Research 121 2000 16-31
- (2000) European Journal of Operational Research , vol.121 , pp. 16-31
- Dias, L.C.¹ Cĺmaco, J.N.²

3
- 24244448206
- The robust shortest path problem with interval data
- to appear
- Karaşan OE, Pinar MÇ, Yaman H. The robust shortest path problem with interval data. Computers and Operations Research, to appear.
- Computers and Operations Research
- Karaşan, O.E.¹ Pinar, M.C.² Yaman, H.³

4
- 25044477564
- Instytut Organizacji i Zarzadzania PWr., Report Serii PRE Nr. 30. European Journal of Operational Research, submitted for publication., Available at
- Zieliński P. The relative robust shortest path problem with interval data. Instytut Organizacji i Zarzadzania PWr., Report Serii PRE Nr. 30. European Journal of Operational Research, submitted for publication. (Available at http://mulhacen.ioz.pwr.wroc.pl/~pziel/publications/reports/ejor3.ps).
- The Relative Robust Shortest Path Problem With Interval Data , vol.30
- Zieliński, P.¹

5
- 0003956830
- Dordrecht: Kluwer Academic Publishers
- Kouvelis P. Yu G. Robust discrete optimization and its applications 1997 Kluwer Academic Publishers Dordrecht
- (1997) Robust Discrete Optimization and Its Applications
- Kouvelis, P.¹ Yu, G.²

6
- 0035425675
- The robust spanning tree problem with interval data
- Yaman H. Karaşan O.E. Pinar MÇ. The robust spanning tree problem with interval data Operations Research Letters 29 2001 31-40
- (2001) Operations Research Letters , vol.29 , pp. 31-40
- Yaman, H.¹ Karaşan, O.E.² Pinar, M.³

7
- 0042639544
- A new shortest paths ranking algorithm
- Martins E.Q.V. dos Santos J.L.E. A new shortest paths ranking algorithm Investigação Operacional 20 1 2000 47-62 (Available at http://www.mat.uc.pt/~eqvm/cientificos/investigacao/ Artigos/K.ps.gz
- (2000) Investiga , vol.20 , Issue.1 , pp. 47-62
- Martins, E.Q.V.¹ dos Santos, J.L.E.²

8
- 0032108018
- Finding the k shortest paths
- Eppstein D. Finding the k shortest paths SIAM Journal on Computing 28 2 1998 652-673
- (1998) SIAM Journal on Computing , vol.28 , Issue.2 , pp. 652-673
- Eppstein, D.¹

9
- 0003515463
- Englewood Cliffs, NJ: Prentice-Hall
- Ahuja R.K. Magnanti T.L. Orlin J.B. Network flows: theory, algorithms and applications 1993 Prentice-Hall Englewood Cliffs, NJ
- (1993) Network Flows: Theory, Algorithms and Applications
- Ahuja, R.K.¹ Magnanti, T.L.² Orlin, J.B.³

10
- 34147120474
- Note on two problems in connection with graphs
- Dijkstra E.W. Note on two problems in connection with graphs Numerische Mathematik 1 1959 269-271
- (1959) Numerische Mathematik , vol.1 , pp. 269-271
- Dijkstra, E.W.¹

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