SCOPUS 정보 검색 플랫폼

Volumn 97, Issue 5, 2006, Pages 177-180

An approximation algorithm for interval data minmax regret combinatorial optimization problems

Author keywords

Approximation algorithms; Combinatorial optimization; Maximal regret; Robust optimization

Indexed keywords

ALGORITHMS; OPTIMIZATION; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; MAXIMAL REGRET; ROBUST OPTIMIZATION;

COMBINATORIAL MATHEMATICS;

EID: 30344473284 PISSN: 00200190 EISSN: None Source Type: Journal
DOI: 10.1016/j.ipl.2005.11.001 Document Type: Article

Times cited : (108)

References (11)

2
- 0142029538
- On the complexity of the robust spanning tree with interval data
- I. Aron, and P. Van Hentenryck On the complexity of the robust spanning tree with interval data Oper. Res. Lett. 32 2004 36 140
- (2004) Oper. Res. Lett. , vol.32 , pp. 36-140
- Aron, I.¹ Van Hentenryck, P.²

3
- 0242458670
- On the complexity of a class of combinatorial optimization problems with uncertainty
- I. Averbakh On the complexity of a class of combinatorial optimization problems with uncertainty Math. Program., Ser. A 90 2001 263 272
- (2001) Math. Program., Ser. A , vol.90 , pp. 263-272
- Averbakh, I.¹

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

5
- 27744547110
- Instytut Matematyki PWr., Wroclaw Raport serii PREPRINTY nr. 007
- A. Kasperski, P. Zieliński, Minimizing maximal regret in linear assignment problems with interval data, Instytut Matematyki PWr., Wroclaw 2004, Raport serii PREPRINTY nr. 007
- (2004) Minimizing Maximal Regret in Linear Assignment Problems with Interval Data
- Kasperski, A.¹ Zieliński, P.²

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
- 7544232733
- A branch and bound algorithm for the robust spanning tree problem with interval data
- R. Montemanni, and L.M. Gambardella A branch and bound algorithm for the robust spanning tree problem with interval data Eur. J. Oper. Res. 161 2005 771 779
- (2005) Eur. J. Oper. Res. , vol.161 , pp. 771-779
- Montemanni, R.¹ Gambardella, L.M.²

9
- 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.³

10
- 0035425675
- The robust spanning tree problem with interval data
- H. Yaman, O.E. Karaşan, and M.C. Pinar The robust spanning tree problem with interval data Oper. Res. Lett. 29 2001 31 40
- (2001) Oper. Res. Lett. , vol.29 , pp. 31-40
- Yaman, H.¹ Karaşan, O.E.² Pinar, M.C.³

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 Eur. J. Oper. Res. 158 2004 570 576
- (2004) Eur. J. Oper. Res. , vol.158 , pp. 570-576
- Zieliński, P.¹

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