메뉴 건너뛰기




Volumn 11, Issue 2, 2000, Pages 308-319

The multiple subset sum problem

Author keywords

Approximation scheme; Knapsack problem; Multiple subset sum problem

Indexed keywords


EID: 0034353730     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623498348481     Document Type: Article
Times cited : (77)

References (10)
  • 1
  • 3
    • 0026881284 scopus 로고
    • The exact LPT method for maximizing the minimum completion time
    • J. CSIRIK, H. KELLERER, AND G.J. WOEGINGER, The exact LPT method for maximizing the minimum completion time, Oper. Res. Lett., 11 (1992), pp. 281-287.
    • (1992) Oper. Res. Lett. , vol.11 , pp. 281-287
    • Csirik, J.1    Kellerer, H.2    Woeginger, G.J.3
  • 4
    • 51249181640 scopus 로고
    • Bin packing can be solved within 1 + ε in linear time
    • W. FERNANDEZ DE LA VEGA AND G.S. LUEKER, Bin packing can be solved within 1 + ε in linear time, Combinatorica, 1 (1981), pp. 349-355.
    • (1981) Combinatorica , vol.1 , pp. 349-355
    • De La Vega, W.F.1    Lueker, G.S.2
  • 6
    • 0020252446 scopus 로고
    • An efficient approximation scheme for the one-dimensional bin packing problem
    • IEEE Computer Society Press, Los Alamitos, CA
    • N. KARMARKAR AND R.M. KARP, An efficient approximation scheme for the one-dimensional bin packing problem, in Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, Los Alamitos, CA, 1982, pp. 312-320.
    • (1982) Proceedings of the 23rd Annual Symposium on Foundations of Computer Science , pp. 312-320
    • Karmarkar, N.1    Karp, R.M.2
  • 7
    • 0020845921 scopus 로고
    • Integer programming with a fixed number of variables
    • H.W. LENSTRA, Integer programming with a fixed number of variables, Math. Oper. Res., 8 (1983), pp. 538-548.
    • (1983) Math. Oper. Res. , vol.8 , pp. 538-548
    • Lenstra, H.W.1
  • 9
    • 0003285868 scopus 로고    scopus 로고
    • Knapsack problems
    • D.Z. Du and P. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA
    • D. PISINGER AND P. TOTH, Knapsack problems, in Handbook of Combinatorial Optimization, D.Z. Du and P. Pardalos, eds., Kluwer Academic Publishers, Norwell, MA, 1998, pp. 1-89.
    • (1998) Handbook of Combinatorial Optimization , pp. 1-89
    • Pisinger, D.1    Toth, P.2
  • 10
    • 0007509207 scopus 로고    scopus 로고
    • personal communication, Katholische Universität Eichstätt
    • G. WIRSCHING, personal communication, Katholische Universität Eichstätt, 1998.
    • (1998)
    • Wirsching, G.1


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