SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Mathematical Programming

Volumn 112, Issue 2, 2008, Pages 473-491

Breakpoint searching algorithms for the continuous quadratic knapsack problem

(1) Kiwiel, Krzysztof C a

a SYSTEMS RESEARCH INSTITUTE (Poland)

Author keywords

Convex programming; Nonlinear programming; Quadratic programming; Separable programming; Singly constrained quadratic program

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; CONVERGENCE OF NUMERICAL METHODS; NONLINEAR PROGRAMMING; QUADRATIC PROGRAMMING;

CONVEX PROGRAMMING; QUADRATIC KNAPSACK PROBLEM; SEPARABLE PROGRAMMING; SINGLY CONSTRAINED QUADRATIC PROGRAM;

PROBLEM SOLVING;

EID: 36749018119 PISSN: 00255610 EISSN: 14364646 Source Type: Journal
DOI: 10.1007/s10107-006-0050-z Document Type: Article

Times cited : (68)

References (27)

1
- 0001797720
- Algorithms for the least-distance problem
- World Scientific Singapore
- Berman P., Kovoor N., Pardalos P.M. (1993) Algorithms for the least-distance problem. In: Pardalos P.M. (ed) Complexity in Numerical Optimization. World Scientific, Singapore, pp. 33-56
- (1993) Complexity in Numerical Optimization , pp. 33-56
- Berman, P.¹ Kovoor, N.² Pardalos, P.M.³ Pardalos, P.M.⁴

2
- 84925931867
- Disaggregation and resource allocation using convex knapsack problems with bounded variables
- Bitran G.R., Hax A.C. (1981) Disaggregation and resource allocation using convex knapsack problems with bounded variables. Manage. Sci. 27, 431-441
- (1981) Manage. Sci. , vol.27 , pp. 431-441
- Bitran, G.R.¹ Hax, A.C.²

3
- 0031075148
- Quadratic resource allocation with generalized upper bounds
- Bretthauer K.M., Shetty B. (1997) Quadratic resource allocation with generalized upper bounds. Oper. Res. Lett. 20, 51-57
- (1997) Oper. Res. Lett. , vol.20 , pp. 51-57
- Bretthauer, K.M.¹ Shetty, B.²

4
- 0001730913
- A branch and bound algorithm for integer quadratic knapsack problems
- Bretthauer K.M., Shetty B., Syam S. (1995) A branch and bound algorithm for integer quadratic knapsack problems. ORSA J. Comput. 7, 109-116
- (1995) ORSA J. Comput. , vol.7 , pp. 109-116
- Bretthauer, K.M.¹ Shetty, B.² Syam, S.³

5
- 0030105440
- A projection method for the integer quadratic knapsack problem
- Bretthauer K.M., Shetty B., Syam S. (1996) A projection method for the integer quadratic knapsack problem. J. Oper. Res. Soc. 47, 457-462
- (1996) J. Oper. Res. Soc. , vol.47 , pp. 457-462
- Bretthauer, K.M.¹ Shetty, B.² Syam, S.³

6
- 0021479943
- An O(n) algorithm for quadratic knapsack problems
- Brucker P. (1984) An O(n) algorithm for quadratic knapsack problems. Oper. Res. Lett. 3, 163-166
- (1984) Oper. Res. Lett. , vol.3 , pp. 163-166
- Brucker, P.¹

7
- 0023564105
- Quasi-Newton updates with bounds
- Calamai P.H., Moré J.J. (1987) Quasi-Newton updates with bounds. SIAM J. Numer. Anal. 24, 1434-1441
- (1987) SIAM J. Numer. Anal. , vol.24 , pp. 1434-1441
- Calamai, P.H.¹ Moré, J.J.²

8
- 0004116989
- 2 MIT Press Cambridge
- Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. (2001) Introduction to Algorithms, 2nd edn. MIT Press, Cambridge
- (2001) Introduction to Algorithms
- Cormen, T.H.¹ Leiserson, C.E.² Rivest, R.L.³ Stein, C.⁴

9
- 26444460409
- Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources
- Cosares S., Hochbaum D.S. (1994) Strongly polynomial algorithms for the quadratic transportation problem with a fixed number of sources. Math. Oper. Res. 19, 94-111
- (1994) Math. Oper. Res. , vol.19 , pp. 94-111
- Cosares, S.¹ Hochbaum, D.S.²

10
- 0005653786
- A Lagrangean relaxation algorithm for the constrained matrix problem
- Cottle R.W., Duvall S.G., Zikan K. (1986) A Lagrangean relaxation algorithm for the constrained matrix problem. Naval Res. Logist. Quart. 33, 55-76
- (1986) Naval Res. Logist. Quart. , vol.33 , pp. 55-76
- Cottle, R.W.¹ Duvall, S.G.² Zikan, K.³

11
- 0016025814
- Validation of subgradient optimization
- Held M., Wolfe P., Crowder H.P. (1974) Validation of subgradient optimization. Math. Program. 6, 62-88
- (1974) Math. Program. , vol.6 , pp. 62-88
- Held, M.¹ Wolfe, P.² Crowder, H.P.³

12
- 0001704043
- A polynomially bounded algorithm for a singly constrained quadratic program
- Helgason K., Kennington J., Lall H. (1980) A polynomially bounded algorithm for a singly constrained quadratic program. Math. Program. 18, 338-343
- (1980) Math. Program. , vol.18 , pp. 338-343
- Helgason, K.¹ Kennington, J.² Lall, H.³

13
- 0001687035
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Hochbaum D.S., Hong S.P. (1995) About strongly polynomial time algorithms for quadratic optimization over submodular constraints. Math. Program. 69, 269-309
- (1995) Math. Program. , vol.69 , pp. 269-309
- Hochbaum, D.S.¹ Hong, S.P.²

14
- 27844582962
- On Floyd and Rivest's select algorithm
- Kiwiel K.C. (2005) On Floyd and Rivest's select algorithm. Theor. Comput. Sci. 347, 214-238
- (2005) Theor. Comput. Sci. , vol.347 , pp. 214-238
- Kiwiel, K.C.¹

15
- 36749060400
- Technical report. Systems Research Institute, Warsaw (in preparation)
- Kiwiel, K.C.: Bracketing methods for the continuous quadratic knapsack problem. Technical report. Systems Research Institute, Warsaw (2006) (in preparation)
- (2006) Bracketing Methods for the Continuous Quadratic Knapsack Problem
- Kiwiel, K.C.¹

16
- 36748999789
- Technical report. Systems Research Institute, Warsaw (in preparation)
- Kiwiel, K.C.: Variable fixing algorithms for the continuous quadratic knapsack problem. Technical report. Systems Research Institute, Warsaw (2006) (in preparation)
- (2006) Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem
- Kiwiel, K.C.¹

17
- 0001008011
- Allocation of effort resources among competing activities
- Luss H., Gupta S.K. (1975) Allocation of effort resources among competing activities. Oper. Res. 23, 360-366
- (1975) Oper. Res. , vol.23 , pp. 360-366
- Luss, H.¹ Gupta, S.K.²

18
- 0008764943
- n
- n. RAIRO Rech. Opér. 31, 7-16
- (1997) RAIRO Rech. Opér. , vol.31 , pp. 7-16
- MacUlan, N.¹ Minoux, M.² Plateau, G.³

19
- 0024716617
- n
- n. Oper. Res. Lett. 8, 219-222
- (1989) Oper. Res. Lett. , vol.8 , pp. 219-222
- MacUlan, N.¹ De Paula Jr., G.G.²

20
- 0027602304
- Linear time algorithms for some separable quadratic programming problems
- Megiddo N., Tamir A. (1993) Linear time algorithms for some separable quadratic programming problems. Oper. Res. Lett. 13, 203-211
- (1993) Oper. Res. Lett. , vol.13 , pp. 203-211
- Megiddo, N.¹ Tamir, A.²

21
- 0022751477
- n
- n. J. Optim. Theory Appl. 50, 195-200
- (1986) J. Optim. Theory Appl. , vol.50 , pp. 195-200
- Michelot, C.¹

22
- 0026835468
- Massively parallel algorithms for singly constrained convex programs
- Nielsen S.S., Zenios S.A. (1992) Massively parallel algorithms for singly constrained convex programs. ORSA J. Comput. 4, 166-181
- (1992) ORSA J. Comput. , vol.4 , pp. 166-181
- Nielsen, S.S.¹ Zenios, S.A.²

23
- 0000859664
- An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds
- Pardalos P.M., Kovoor N. (1990) An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Program. 46, 321-328
- (1990) Math. Program. , vol.46 , pp. 321-328
- Pardalos, P.M.¹ Kovoor, N.²

24
- 0027113483
- On the continuous quadratic knapsack problem
- Robinson A.G., Jiang N., Lerme C.S. (1992) On the continuous quadratic knapsack problem. Math. Program. 55, 99-108
- (1992) Math. Program. , vol.55 , pp. 99-108
- Robinson, A.G.¹ Jiang, N.² Lerme, C.S.³

25
- 84974858066
- A parallel projection for the multicommodity network model
- Shetty B., Muthukrishnan R. (1990) A parallel projection for the multicommodity network model. J. Oper. Res. Soc. 41, 837-842
- (1990) J. Oper. Res. Soc. , vol.41 , pp. 837-842
- Shetty, B.¹ Muthukrishnan, R.²

26
- 84987041036
- Computational development of a Lagrangian dual approach for quadratic networks
- Ventura J.A.(1991) Computational development of a Lagrangian dual approach for quadratic networks. Networks 21, 469-485
- (1991) Networks , vol.21 , pp. 469-485
- Ventura, J.A.¹

27
- 0001855779
- Simple ranking methods for allocation of one resource
- Zipkin P.H. (1980) Simple ranking methods for allocation of one resource. Manage. Sci. 26, 34-43
- (1980) Manage. Sci. , vol.26 , pp. 34-43
- Zipkin, P.H.¹

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