메뉴 건너뛰기




Volumn 47, Issue 3, 1996, Pages 457-462

A projection method for the integer quadratic knapsack problem

Author keywords

Integer programming; Quadratic knapsack problem

Indexed keywords

ALGORITHMS; CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; PIECEWISE LINEAR TECHNIQUES; PROBLEM SOLVING; TREES (MATHEMATICS);

EID: 0030105440     PISSN: 01605682     EISSN: 14769360     Source Type: Journal    
DOI: 10.1057/jors.1996.44     Document Type: Article
Times cited : (14)

References (7)
  • 1
    • 0001730913 scopus 로고
    • A branch and bound algorithm for integer quadratic knapsack problems
    • K. M. Bretthauer, B. Shetty and S. Syam (1995) A branch and bound algorithm for integer quadratic knapsack problems. ORSA J. Computing 7, 109-116.
    • (1995) ORSA J. Computing , vol.7 , pp. 109-116
    • Bretthauer, K.M.1    Shetty, B.2    Syam, S.3
  • 2
    • 0027113483 scopus 로고
    • On the continuous quadratic knapsack problem
    • A. G. Robinson, N. Jiang and C. S. Lerme (1992) On the continuous quadratic knapsack problem. Math. Prog. 55, 99-108.
    • (1992) Math. Prog , vol.55 , pp. 99-108
    • Robinson, A.G.1    Jiang, N.2    Lerme, C.S.3
  • 3
    • 0001704043 scopus 로고
    • A polynomially bounded algorithm for a singly constrained quadratic program
    • R. Helgason, J. Kennington and H. Lall (1980) A polynomially bounded algorithm for a singly constrained quadratic program. Math. Prog. 18, 338-343.
    • (1980) Math. Prog , vol.18 , pp. 338-343
    • Helgason, R.1    Kennington, J.2    Lall, H.3
  • 4
    • 0026835468 scopus 로고
    • Massively parallel algorithms for singly constrained convex programs
    • S. S. Nielsen and S. A. Zenios (1992) Massively parallel algorithms for singly constrained convex programs. ORSA J. Computing 4, 166-181.
    • (1992) ORSA J. Computing , vol.4 , pp. 166-181
    • Nielsen, S.S.1    Zenios, S.A.2
  • 5
    • 0000859664 scopus 로고
    • An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
    • P. M. Pardalos and N. Kovoor (1990) An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Prog. 46, 321-328.
    • (1990) Math. Prog , vol.46 , pp. 321-328
    • Pardalos, P.M.1    Kovoor, N.2
  • 6
    • 84974858066 scopus 로고
    • A parallel projection for the multicommodity network model
    • B. Shetty and R. Muthukrishnan (1990) A parallel projection for the multicommodity network model. J. Opl Res. Soc. 41, 837-842.
    • (1990) J. Opl Res. Soc , vol.41 , pp. 837-842
    • Shetty, B.1    Muthukrishnan, R.2


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