메뉴 건너뛰기




Volumn 7, Issue 1-2, 1980, Pages 55-66

Reducing the size of the nondominated set: Pruning by clustering

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0002096988     PISSN: 03050548     EISSN: None     Source Type: Journal    
DOI: 10.1016/0305-0548(80)90014-3     Document Type: Article
Times cited : (173)

References (23)
  • 3
    • 84912313402 scopus 로고
    • A five phase procedure for implementing a vector maximum algorithm for multiple objective linear programming problems
    • University of Kentucky
    • (1976) Working Paper
    • Steuer1
  • 4
    • 84912313401 scopus 로고    scopus 로고
    • A. A. Törn, A sampling-search-clustering approach for exploring the feasible/efficient solutions of MCDM problems. Comp. Op. Res. this issue.
  • 15
  • 18
    • 0042532657 scopus 로고
    • Linear multiple objective programming: Theory and computational experience
    • University of North Carolina
    • (1973) Ph. D. Thesis
    • Steuer1
  • 21
    • 0002900909 scopus 로고
    • Intra-set point generation and filtering in decision and criterion space
    • (1980) Comp. Op. Res. , vol.7 , Issue.1-2 , pp. 41-53
    • Steuer1    Harris2
  • 23
    • 84912313397 scopus 로고
    • A ranking algorithm for pruning
    • University of Delaware, Newark, Delaware
    • (1980) Working Paper
    • Morse1


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