메뉴 건너뛰기




Volumn 43, Issue 1, 2009, Pages 1-22

Algorithm for cardinality-constrained quadratic optimization

Author keywords

Branch and bound; Lemke's method; Mixed integer quadratic programming; Portfolio selection; Subset selection

Indexed keywords

BRANCH-AND-BOUND; LEMKE'S METHOD; MIXED-INTEGER QUADRATIC PROGRAMMING; PORTFOLIO SELECTION; SUBSET SELECTION;

EID: 67449105362     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9126-9     Document Type: Article
Times cited : (214)

References (25)
  • 2
    • 0014184207 scopus 로고
    • The discarding of variables in multivariate analysis
    • E.M.L. Beale M.G. Kendall D.W. Mann 1967 The discarding of variables in multivariate analysis Biometrika 54 3/4 357 366
    • (1967) Biometrika , vol.54 , Issue.3-4 , pp. 357-366
    • Beale, E.M.L.1    Kendall, M.G.2    Mann, D.W.3
  • 3
    • 0040036550 scopus 로고    scopus 로고
    • Portfolio construction through mixed-integer programming at Grantham, Mayo, Van Otterloo and Company
    • D. Bertsimas C. Darnell R. Soucy 1999 Portfolio construction through mixed-integer programming at Grantham, Mayo, Van Otterloo and Company Interfaces 29 1 49 66
    • (1999) Interfaces , vol.29 , Issue.1 , pp. 49-66
    • Bertsimas, D.1    Darnell, C.2    Soucy, R.3
  • 4
    • 0008633562 scopus 로고    scopus 로고
    • Computational study of a family of mixed-integer quadratic programming problems
    • D. Bienstock 1996 Computational study on families of mixed-integer quadratic programming problems Math. Program. 74 121 140 (Pubitemid 126407431) (Pubitemid 126407431)
    • (1996) Mathematical Programming, Series B , vol.74 , Issue.2 , pp. 121-140
    • Bienstock, D.1
  • 6
    • 0034333695 scopus 로고    scopus 로고
    • Heuristics for cardinality constrained portfolio optimisation
    • DOI 10.1016/S0305-0548(99)00074-X, PII S030505489900074X
    • T.J. Chang N. Meade J.E. Beasley Y. Sharaiha 2000 Heuristics for cardinality constrained portfolio optimisation Comput. Operat. Res. 27 1271 1302 (Pubitemid 30603255) (Pubitemid 30603255)
    • (2000) Computers and Operations Research , vol.27 , Issue.13 , pp. 1271-1302
    • Chang, T.-J.1    Meade, N.2    Beasley, J.E.3    Sharaiha, Y.M.4
  • 8
    • 67449105047 scopus 로고    scopus 로고
    • ILOG CPLEX 8.1 User Manual. ILOG CPLEX Division, Incline Village, NV
    • ILOG CPLEX 8.1 User Manual. ILOG CPLEX Division, Incline Village, NV (2002)
    • (2002)
  • 9
  • 10
    • 84946633097 scopus 로고
    • Selection of the best subset in regression analysis
    • R.R. Hockings R.N. Leslie 1967 Selection of the best subset in regression analysis Technometrics 9 4 531 540
    • (1967) Technometrics , vol.9 , Issue.4 , pp. 531-540
    • Hockings, R.R.1    Leslie, R.N.2
  • 11
    • 0000848547 scopus 로고
    • A limited diversification portfolio selection model for the small investor
    • N. Jacob 1974 A limited diversification portfolio selection model for the small investor J. Finance 29 3 847 856
    • (1974) J. Finance , vol.29 , Issue.3 , pp. 847-856
    • Jacob, N.1
  • 12
    • 85008834188 scopus 로고    scopus 로고
    • Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints
    • N. Jobst M. Horniman C. Lucas G. Mitra 2001 Computational aspects of alternative portfolio selection models in the presence of discrete asset choice constraints Quant. Finance 1 5 489 501
    • (2001) Quant. Finance , vol.1 , Issue.5 , pp. 489-501
    • Jobst, N.1    Horniman, M.2    Lucas, C.3    Mitra, G.4
  • 13
    • 0001644591 scopus 로고
    • Bimatrix equilibrium points and mathematical programming
    • C.E. Lemke 1965 Bimatrix equilibrium points and mathematical programming Manag. Sci. 11 7 681 689
    • (1965) Manag. Sci. , vol.11 , Issue.7 , pp. 681-689
    • Lemke, C.E.1
  • 15
    • 0008397584 scopus 로고    scopus 로고
    • Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints
    • H. Konno A. Wijayanayake 2001 Portfolio optimization problem under concave transaction costs and minimal transaction unit constraints Math. Program. 89 233 250
    • (2001) Mathematical Programming, Series B , vol.89 , Issue.2 , pp. 233-250
    • Konno, H.1    Wijayanayake, A.2
  • 16
  • 17
    • 0033115630 scopus 로고    scopus 로고
    • Heuristic algorithms for portfolio selection problem with minimum transaction lots
    • R. Mansini M.G. Speranza 1999 Heuristic algorithms for portfolio selection problem with minimum transaction lots Eur. J. Operat. Res. 114 1 219 233
    • (1999) Eur. J. Operat. Res. , vol.114 , Issue.1 , pp. 219-233
    • Mansini, R.1    Speranza, M.G.2
  • 19
    • 0018503877 scopus 로고
    • SELECTION OF VARIABLES IN LINEAR REGRESSION USING THE MINIMUM SUM OF WEIGHTED ABSOLUTE ERRORS CRITERION.
    • S. Narula J. Wellington 1979 Selection of variables in linear regression using the minimum sum of weighted absolute errors criterion Technometrics 21 3 299 311 (Pubitemid 9472203) (Pubitemid 9472203)
    • (1979) Technometrics , vol.21 , Issue.3 , pp. 299-306
    • Narula Subhash, C.1    Wellington John, F.2
  • 21
    • 0000833262 scopus 로고
    • A simple algorithm for optimal portfolio selection with fixed transaction costs
    • N. Patel M. Subrahmanyam 1982 A simple algorithm for optimal portfolio selection with fixed transaction costs Manag. Sci. 28 3 303 314
    • (1982) Manag. Sci. , vol.28 , Issue.3 , pp. 303-314
    • Patel, N.1    Subrahmanyam, M.2
  • 24
    • 0000142637 scopus 로고
    • A linear programming algorithm for mutual fund portfolio selection
    • W. Sharpe 1967 A linear programming algorithm for mutual fund portfolio selection Manag. Sci. 13 7 499 510
    • (1967) Manag. Sci. , vol.13 , Issue.7 , pp. 499-510
    • Sharpe, W.1
  • 25
    • 84967369360 scopus 로고
    • A linear programming approximation for the general portfolio analysis problem
    • W. Sharpe 1971 A linear programming approximation for the general portfolio analysis problem J. Financ. Quant. Anal. 6 5 1263 1275
    • (1971) J. Financ. Quant. Anal. , vol.6 , Issue.5 , pp. 1263-1275
    • Sharpe, W.1


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