메뉴 건너뛰기




Volumn 207, Issue 3, 2010, Pages 1489-1496

An aggregate label setting policy for the multi-objective shortest path problem

Author keywords

Label setting; Multi objective; Shortest path

Indexed keywords

LABEL-SETTING ALGORITHM; LEXICOGRAPHIC ORDER; MULTI OBJECTIVE; MULTI-OBJECTIVE SHORTEST PATH PROBLEMS; SHORTEST PATH; WEIGHTED SUM;

EID: 77957698526     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2010.06.035     Document Type: Article
Times cited : (25)

References (15)
  • 1
    • 33748955904 scopus 로고    scopus 로고
    • Editorial: Introduction to the special issue
    • E. Erkut Editorial: Introduction to the special issue Computers & Operations Research 34 2007 1241 1242
    • (2007) Computers & Operations Research , vol.34 , pp. 1241-1242
    • Erkut, E.1
  • 2
    • 33644936205 scopus 로고    scopus 로고
    • Martins algorithm revisited for multi-objective shortest path problems with a maxmin cost function
    • X. Gandibleux, F. Beugnies, and S. Randriamasy Martins algorithm revisited for multi-objective shortest path problems with a maxmin cost function 4OR 4 2006 47 59
    • (2006) 4OR , vol.4 , pp. 47-59
    • Gandibleux, X.1    Beugnies, F.2    Randriamasy, S.3
  • 4
    • 0000072462 scopus 로고
    • Bicriterion path problems
    • Multiple Criteria Decision Making Theory and Application
    • P. Hansen Bicriterion path problems G. Fandel, T. Gal, Multiple Criteria Decision Making Theory and Application Lecture Notes in Economics and Mathematical Systems vol. 177 1980 Springer 109 127
    • (1980) Lecture Notes in Economics and Mathematical Systems , vol.177 , pp. 109-127
    • Hansen, P.1
  • 7
    • 77649190205 scopus 로고    scopus 로고
    • On algorithms for the tricriteria shortest path problem with two bottleneck objective functions
    • L. de Lima Pinto, and M.M.B. Pascoal On algorithms for the tricriteria shortest path problem with two bottleneck objective functions Computers & Operations Research 37 2010 1774 1779
    • (2010) Computers & Operations Research , vol.37 , pp. 1774-1779
    • De Lima Pinto, L.1    Pascoal, M.M.B.2
  • 10
    • 77957691751 scopus 로고    scopus 로고
    • Labelling methods for the general case of the multiobjective shortest path problem-a computational study
    • University of Coimbra
    • J.P. Paixão, J.L. Santos, Labelling methods for the general case of the multiobjective shortest path problem-a computational study. Technical Report 7-2009, Centro de Investigaão Operacional, University of Coimbra, (2009)
    • (2009) Technical Report 7-2009, Centro de InvestigaÇão Operacional
    • Paixão, J.P.1
  • 11
    • 54449087873 scopus 로고    scopus 로고
    • A comparison of solution strategies for biobjective shortest path problems
    • A. Raith, and M. Ehrgott A comparison of solution strategies for biobjective shortest path problems Computers & Operations Research 36 2009 1299 1331
    • (2009) Computers & Operations Research , vol.36 , pp. 1299-1331
    • Raith, A.1    Ehrgott, M.2
  • 12
    • 27844467600 scopus 로고    scopus 로고
    • New polynomial time algorithms to compute a set of pareto optimal paths for multi-objective shortest path problems
    • V.N. Sastry, T.N. Janakiraman, and I. Ismail Mohideen New polynomial time algorithms to compute a set of pareto optimal paths for multi-objective shortest path problems International Journal of Computer Mathematics 82 2005 289 300
    • (2005) International Journal of Computer Mathematics , vol.82 , pp. 289-300
    • Sastry, V.N.1    Janakiraman, T.N.2    Ismail Mohideen, I.3
  • 13
    • 0346456172 scopus 로고    scopus 로고
    • A classification of bicriterion shortest path (bsp) algorithms
    • A.J.V. Skriver A classification of bicriterion shortest path (bsp) algorithms Asia Pacific Journal of Operational Research 17 2000 192 212
    • (2000) Asia Pacific Journal of Operational Research , vol.17 , pp. 192-212
    • Skriver, A.J.V.1


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