SCOPUS 정보 검색 플랫폼

Journal of Global Optimization

Volumn 50, Issue 4, 2011, Pages 657-673

An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable

(3) Lin, Geng a,c Zhu, Wenxing a Ali, M M b

a FUZHOU UNIVERSITY (China)

b UNIVERSITY OF THE WITWATERSRAND (South Africa)

c MINJIANG UNIVERSITY (China)

Author keywords

Branch and bound; Knapsack problem; Mixed integer programming

Indexed keywords

BRANCH AND BOUNDS; CONTINUOUS VARIABLES; DYNAMIC PROGRAMMING ALGORITHM; EXACT ALGORITHMS; KNAPSACK PROBLEMS; MIXED INTEGER PROGRAMMING; NP-HARD PROBLEM; NUMERICAL EXPERIMENTS;

ALGORITHMS; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; LINEAR PROGRAMMING; NUMERICAL METHODS; PROFITABILITY;

INTEGER PROGRAMMING;

EID: 80051587963 PISSN: 09255001 EISSN: 15732916 Source Type: Journal
DOI: 10.1007/s10898-010-9642-5 Document Type: Article

Times cited : (17)

References (15)

1
- 3042514606
- On the facets of the mixed-integer knapsack polyhedron
- 10.1007/s10107-003-0400-z
- A. Atamtürk 2003 On the facets of the mixed-integer knapsack polyhedron Math. Program. 98 145 175 10.1007/s10107-003-0400-z
- (2003) Math. Program. , vol.98 , pp. 145-175
- Atamtürk, A.¹

2
- 0000185277
- A lift-and-project cutting plane algorithm for mixed 0-1 programs
- 10.1007/BF01581273
- E. Balas S. Ceria G. Comuéjols 1993 A lift-and-project cutting plane algorithm for mixed 0-1 programs Math. Program. 58 295 324 10.1007/BF01581273
- (1993) Math. Program. , vol.58 , pp. 295-324
- Balas, E.¹ Ceria, S.² Comuéjols, G.³

3
- 0037870067
- Mixed 0-1 programming by lift-and-project in a branch-and-cut framework
- E. Balas S. Ceria G. Comuéjols 1996 Mixed 0-1 programming by lift-and-project in a branch-and-cut framework Manag. Sci. 42 1229 1246 10.1287/mnsc.42.9.1229 (Pubitemid 126557126)
- (1996) Management Science , vol.42 , Issue.9 , pp. 1229-1246
- Balas, E.¹ Ceria, S.² Cornuejols, G.³

4
- 77957705746
- Manuskripte aus den Instituten fur Betriebswirtschaftslehre der Universitat Kiel 629
- Buther, M., Briskorn, D.: Reducing the 0-1 knapsack problem with a single continuous variable to the standard 0-1 knapsack problem. Manuskripte aus den Instituten fur Betriebswirtschaftslehre der Universitat Kiel 629 (2007)
- (2007) Reducing the 0-1 Knapsack Problem with A Single Continuous Variable to the Standard 0-1 Knapsack Problem
- Buther, M.¹ Briskorn, D.²

5
- 0003603813
- Freeman W.H. and Company San Francisco
- Garey M.R., Johnson D.S.: Computers and Intractability-A Guide to the Theory of NP-completeness. Freeman W.H. and Company, San Francisco (1979)
- (1979) Computers and Intractability-A Guide to the Theory of NP-completeness
- Garey, M.R.¹ Johnson, D.S.²

6
- 33749410679
- A major appliance manufacturer rethinks its inventory policies for service vehicles
- DOI 10.1287/inte.1060.0232
- M.F. Gorman S. Ahire 2006 A major appliance manufacturer rethinks its inventory policies for service vehicles Interfaces 36 5 407 419 10.1287/inte.1060.0232 (Pubitemid 44506612)
- (2006) Interfaces , vol.36 , Issue.5 , pp. 407-419
- Gorman, M.F.¹ Ahire, S.²

7
- 0002217386
- Quicksort
- 10.1093/comjnl/5.1.10
- C.A.R. Hoare 1962 Quicksort Comput. J. 5 1 10 15 10.1093/comjnl/5.1.10
- (1962) Comput. J. , vol.5 , Issue.1 , pp. 10-15
- Hoare, C.A.R.¹

8
- 4544273778
- Springer Berlin
- Kellerer H., Pferschy U., Pisinger D.: Knapsack Problems. Springer, Berlin (2004)
- (2004) Knapsack Problems
- Kellerer, H.¹ Pferschy, U.² Pisinger, D.³

9
- 0036543735
- Strengthening Chvátal-Gomory cuts and Gomory fractional cuts
- DOI 10.1016/S0167-6377(02)00112-8, PII S0167637702001128
- A.N. Letchford A. Lodi 2002 Strengthening Chvátal-Gomory cuts and gomory fractional cuts Oper. Res. Lett. 30 2 74 82 10.1016/S0167-6377(02)00112-8 (Pubitemid 34716065)
- (2002) Operations Research Letters , vol.30 , Issue.2 , pp. 74-82
- Letchford, A.N.¹ Lodi, A.²

10
- 0002496107
- The 0-1 knapsack problem with a single continuous variable
- 10.1007/s101070050044
- H. Marchand L.A. Wolsey 1999 The 0-1 knapsack problem with a single continuous variable Math. Program. 85 15 33 10.1007/s101070050044
- (1999) Math. Program. , vol.85 , pp. 15-33
- Marchand, H.¹ Wolsey, L.A.²

11
- 0035328755
- Aggregation and mixed integer rounding to solve mips
- H. Marchand L.A. Wolsey 2001 Aggregation and mixed integer rounding to solve MIPs Oper. Res. 49 363 371 10.1287/opre.49.3.363.11211 (Pubitemid 32672508)
- (2001) Operations Research , vol.49 , Issue.3 , pp. 363-371
- Marchand, H.¹ Wolsey, L.A.²

12
- 0032687866
- Dynamic programming and strong bounds for the 0-1 knapsack problem
- 10.1287/mnsc.45.3.414
- S. Martello D. Pisinger P. Toth 1999 Dynamic programming and strong bounds for the 0-1 knapsack problem Manag. Sci. 45 3 414 424 10.1287/mnsc.45.3.414
- (1999) Manag. Sci. , vol.45 , Issue.3 , pp. 414-424
- Martello, S.¹ Pisinger, D.² Toth, P.³

13
- 0033894212
- New trends in exact algorithms for the 0-1 knapsack problem
- DOI 10.1016/S0377-2217(99)00260-X
- S. Martello D. Pisinger P. Toth 2000 New trends in exact algorithms for the 0-1 knapsack problem Eur. J. Oper. Res. 123 325 332 10.1016/S0377-2217(99) 00260-X (Pubitemid 30596941)
- (2000) European Journal of Operational Research , vol.123 , Issue.2 , pp. 325-332
- Martello, S.¹ Pisinger, D.² Toth, P.³

14
- 0019623858
- On the complexity of integer programming
- DOI 10.1145/322276.322287
- C.H. Papadimitriou 1981 On the complexity of integer programming J. ACM 28 765 768 10.1145/322276.322287 (Pubitemid 12514087)
- (1981) Journal of the ACM , vol.28 , Issue.4 , pp. 765-768
- Papadimitriou Christos, H.¹

15
- 0029497065
- An expanding-core algorithm for the exact 0-1 Knapsack Problem
- 10.1016/0377-2217(94)00013-3
- D. Pisinger 1995 An expanding-core algorithm for the exact 0-1 Knapsack Problem Eur. J. Oper. Res. 87 175 187 10.1016/0377-2217(94)00013-3
- (1995) Eur. J. Oper. Res. , vol.87 , pp. 175-187
- Pisinger, D.¹

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