SCOPUS 정보 검색 플랫폼

Volumn 34, Issue 1, 2006, Pages 69-76

The robust shortest path problem in series-parallel multidigraphs with interval data

Author keywords

Combinatorial optimization; NP hardness; Pseudopolynomial algorithm; Robust optimization; Shortest path problem

Indexed keywords

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; OPTIMIZATION; POLYNOMIALS;

COMBINATORIAL OPTIMIZATION; PSEUDOPOLYNOMIAL ALGORITHM; ROBUST OPTIMIZATION; SHORTEST PATH PROBLEM;

PROBLEM SOLVING;

EID: 28044451499 PISSN: 01676377 EISSN: None Source Type: Journal
DOI: 10.1016/j.orl.2005.01.008 Document Type: Article

Times cited : (37)

References (11)

1
- 1642617399
- Interval data minimax regret network optimization problems
- I. Averbakh, and V. Lebedev Interval data minimax regret network optimization problems Discrete. Appl. Math. 138 2004 289 301
- (2004) Discrete. Appl. Math. , vol.138 , pp. 289-301
- Averbakh, I.¹ Lebedev, V.²

2
- 0037211593
- On the hardness of evaluating criticality of activities in a planar network with duration intervals
- S. Chanas, and P. Zieliński On the hardness of evaluating criticality of activities in a planar network with duration intervals Oper. Res. Lett. 31 2003 53 59
- (2003) Oper. Res. Lett. , vol.31 , pp. 53-59
- Chanas, S.¹ Zieliński, P.²

3
- 0037410243
- On latest starting times and floats in activity networks with ill-known durations
- D. Dubois, H. Fargier, and V. Galvagnon On latest starting times and floats in activity networks with ill-known durations European J. Oper. Res. 147 2003 266 280
- (2003) European J. Oper. Res. , vol.147 , pp. 266-280
- Dubois, D.¹ Fargier, H.² Galvagnon, V.³

4
- 0003603813
- W.H. Freeman San Francisco
- M.R. Garey, and D.S. Johnson Computers and Intractability A Guide to the Theory of NP-Completeness 1979 W.H. Freeman San Francisco
- (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

5
- 24244448206
- The robust shortest path problem with interval data
- O.E. Karasan, M.C. Pinar, H. Yaman, The robust shortest path problem with interval data, Comput. Oper. Res. (2002).
- (2002) Comput. Oper. Res.
- Karasan, O.E.¹ Pinar, M.C.² Yaman, H.³

6
- 0003956830
- Kluwer Academic Publishers Boston
- P. Kouvelis, and G. Yu Robust Discrete Optimization and Its Applications 1997 Kluwer Academic Publishers Boston
- (1997) Robust Discrete Optimization and Its Applications
- Kouvelis, P.¹ Yu, G.²

7
- 1842843696
- An exact algorithm for the robust shortest path problem with interval data
- R. Montemanni, and L.M. Gambardella An exact algorithm for the robust shortest path problem with interval data Comput. Oper. Res. 31 2004 1667 1680
- (2004) Comput. Oper. Res. , vol.31 , pp. 1667-1680
- Montemanni, R.¹ Gambardella, L.M.²

8
- 0348233470
- A branch and bound algorithm for the robust shortest path problem with interval data
- R. Montemanni, L.M. Gambardella, and A.V. Donati A branch and bound algorithm for the robust shortest path problem with interval data Oper. Res. Lett. 32 2004 225 232
- (2004) Oper. Res. Lett. , vol.32 , pp. 225-232
- Montemanni, R.¹ Gambardella, L.M.² Donati, A.V.³

9
- 0001404569
- The recognition of series parallel digraphs
- J. Valdes, R.E. Tarjan, and E.L. Lawler The recognition of series parallel digraphs SIAM J. Comput. 11 2 1982 298 313
- (1982) SIAM J. Comput. , vol.11 , Issue.2 , pp. 298-313
- Valdes, J.¹ Tarjan, R.E.² Lawler, E.L.³

10
- 0032093911
- On the robust shortest path problem
- G. Yu, and J. Yang On the robust shortest path problem Comput. Oper. Res. 6 1998 457 468
- (1998) Comput. Oper. Res. , vol.6 , pp. 457-468
- Yu, G.¹ Yang, J.²

11
- 2942622602
- The computational complexity of the relative robust shortest path problem with interval data
- P. Zieliński The computational complexity of the relative robust shortest path problem with interval data European J. Oper. Res. 158 2004 570 576
- (2004) European J. Oper. Res. , vol.158 , pp. 570-576
- Zieliński, P.¹

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