메뉴 건너뛰기




Volumn 3612, Issue PART III, 2005, Pages 808-811

A genetic algorithm for solving portfolio optimization problems with transaction costs and minimum transaction lots

Author keywords

[No Author keywords available]

Indexed keywords

COSTS; INTEGER PROGRAMMING; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; OPTIMIZATION; PROBLEM SOLVING;

EID: 26844542019     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539902_99     Document Type: Conference Paper
Times cited : (20)

References (5)
  • 1
    • 0033115630 scopus 로고    scopus 로고
    • Heuristic algorithms for a portfolio selection problem with minimum transaction lots
    • Masini, R., Speranza, M.G.: Heuristic Algorithms for a Portfolio Selection Problem with Minimum Transaction Lots. European Journal of Operational Research. 114(1999) 219-233
    • (1999) European Journal of Operational Research , vol.114 , pp. 219-233
    • Masini, R.1    Speranza, M.G.2
  • 3
    • 0008397584 scopus 로고    scopus 로고
    • Portfolio optimization problems under concave transaction costs and minimal transaction unit constraints
    • Konno, H., Wijayanayake, A.: Portfolio Optimization Problems under Concave Transaction Costs and Minimal Transaction Unit Constraints. Mathematical Programming. 89(2001) 233-250
    • (2001) Mathematical Programming , vol.89 , pp. 233-250
    • Konno, H.1    Wijayanayake, A.2
  • 5
    • 0000991259 scopus 로고
    • Simulated binary crossover for continuous search space
    • Deb, K., Agrawal, R.B.: Simulated Binary Crossover for Continuous Search Space. Complex Systems. 9(1995) 115-148
    • (1995) Complex Systems , vol.9 , pp. 115-148
    • Deb, K.1    Agrawal, R.B.2


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