{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:28:18Z","timestamp":1759847298893,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2005,6,25]],"date-time":"2005-06-25T00:00:00Z","timestamp":1119657600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,6,25]]},"DOI":"10.1145\/1068009.1068114","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"629-635","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["An evolutionary lagrangian method for the 0\/1 multiple knapsack problem"],"prefix":"10.1145","author":[{"given":"Yourim","family":"Yoon","sequence":"first","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]},{"given":"Yong-Hyuk","family":"Kim","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]},{"given":"Byung-Ro","family":"Moon","sequence":"additional","affiliation":[{"name":"Seoul National University, Seoul, Korea"}]}],"member":"320","published-online":{"date-parts":[[2005,6,25]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"2","volume-title":"Proceedings of the International Conference on Genetic Algorithms","author":"B\u00e4ck T.","year":"1991","unstructured":"T. B\u00e4ck , F. Hoffmeister , and H. P. Schwefel . A survey of evolution strategies . In Proceedings of the International Conference on Genetic Algorithms , pages 2 -- 9 , 1991 . T. B\u00e4ck, F. Hoffmeister, and H. P. Schwefel. A survey of evolution strategies. In Proceedings of the International Conference on Genetic Algorithms, pages 2--9, 1991."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1016\/S0377-2217(99)00261-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.5555\/998670.998947"},{"key":"e_1_3_2_1_4_1","first-page":"213","volume-title":"Proceedings of the Symposium on Discrete Algorithms","author":"Chekuri C.","year":"2000","unstructured":"C. Chekuri and S. Khanna . A PTAS for the multiple knapsack problem . In Proceedings of the Symposium on Discrete Algorithms , pages 213 -- 222 , 2000 . C. Chekuri and S. Khanna. A PTAS for the multiple knapsack problem. In Proceedings of the Symposium on Discrete Algorithms, pages 213--222, 2000."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1023\/A:1009642405419"},{"key":"e_1_3_2_1_7_1","first-page":"251","volume-title":"Artificial Neural Networks and Genetic Algorithms 3","author":"Cotta C.","year":"1997","unstructured":"C. Cotta and J. M. Troya . A hybrid genetic algorithm for the 0-1 multiple knapsack problem . In G. D. Smith, N. C. Steele, and R. F. Albrecht, editors, Artificial Neural Networks and Genetic Algorithms 3 , pages 251 -- 255 . Springer-Verlag , 1997 . C. Cotta and J. M. Troya. A hybrid genetic algorithm for the 0-1 multiple knapsack problem. In G. D. Smith, N. C. Steele, and R. F. Albrecht, editors, Artificial Neural Networks and Genetic Algorithms 3, pages 251--255. Springer-Verlag, 1997."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1016\/0166-218X(94)90209-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1016\/0377-2217(84)90053-5"},{"key":"e_1_3_2_1_10_1","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey M.","year":"1979","unstructured":"M. Garey and D. S. Johnson . Computers and Intractability: A Guide to the Theory of NP-Completeness . W. H. Freeman and Company , 1979 . M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, 1979."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1016\/0305-0548(78)90018-7"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1007\/BF02591863"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/BFb0120690"},{"key":"e_1_3_2_1_14_1","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"Goldberg D.","year":"1989","unstructured":"D. Goldberg . Genetic Algorithms in Search, Optimization, and Machine Learning . Addison-Wesley , 1989 . D. Goldberg. Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, 1989."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_16_1","DOI":"10.5555\/646687.759484"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/326619.326694"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/SFCS.1977.11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1007\/978-1-4613-1361-8_28"},{"key":"e_1_3_2_1_20_1","volume-title":"Optimization by Vector Space Methods","author":"Luenberger D. G.","year":"1969","unstructured":"D. G. Luenberger . Optimization by Vector Space Methods . John Wiley & Sons, Inc. , 1969 . D. G. Luenberger. Optimization by Vector Space Methods. John Wiley & Sons, Inc., 1969."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1016\/0377-2217(84)90286-8"},{"key":"e_1_3_2_1_22_1","volume-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello S.","year":"1990","unstructured":"S. Martello and P. Toth . Knapsack Problems: Algorithms and Computer Implementations . John Wiley & Sons, Ltd. , 1990 . S. Martello and P. Toth. Knapsack Problems: Algorithms and Computer Implementations. John Wiley & Sons, Ltd., 1990."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.5555\/42805"},{"key":"e_1_3_2_1_24_1","first-page":"596","volume-title":"Proceedings of the Congress on Evolutionary Computation","volume":"1","author":"Raidl G.","year":"1999","unstructured":"G. Raidl . Weight-codings in a genetic algorithm for the multiconstraint knapsack problem . In Proceedings of the Congress on Evolutionary Computation , volume 1 , pages 596 -- 603 . IEEE Press , 1999 . G. Raidl. Weight-codings in a genetic algorithm for the multiconstraint knapsack problem. In Proceedings of the Congress on Evolutionary Computation, volume 1, pages 596--603. IEEE Press, 1999."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/ICEC.1998.699502"},{"key":"e_1_3_2_1_26_1","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"Reeves C. R.","year":"1993","unstructured":"C. R. Reeves , editor. Modern Heuristic Techniques for Combinatorial Problems . Halsted Press , 1993 . C. R. Reeves, editor. Modern Heuristic Techniques for Combinatorial Problems. Halsted Press, 1993."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_27_1","DOI":"10.1145\/321864.321873"},{"key":"e_1_3_2_1_28_1","first-page":"334","volume-title":"Proceedings of the International Joint Conferences on Artificial Intelligence","author":"Schuurmans D.","year":"2001","unstructured":"D. Schuurmans , F. Southey , and R. C. Holte . The exponentiated subgradient algorithm for heuristic boolean programming . In Proceedings of the International Joint Conferences on Artificial Intelligence , pages 334 -- 341 , 2001 . D. Schuurmans, F. Southey, and R. C. Holte. The exponentiated subgradient algorithm for heuristic boolean programming. In Proceedings of the International Joint Conferences on Artificial Intelligence, pages 334--341, 2001."},{"key":"e_1_3_2_1_29_1","first-page":"378","volume-title":"Proceedings of the International Joint Conferences on Artificial Intelligence","author":"Shang Y.","year":"1997","unstructured":"Y. Shang and B. W. Wah . Discrete Lagrangian-based search for solving MAX-SAT problems . In Proceedings of the International Joint Conferences on Artificial Intelligence , pages 378 -- 383 , 1997 . Y. Shang and B. W. Wah. Discrete Lagrangian-based search for solving MAX-SAT problems. In Proceedings of the International Joint Conferences on Artificial Intelligence, pages 378--383, 1997."},{"key":"e_1_3_2_1_30_1","first-page":"226","article-title":"Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms","volume":"32","author":"Thiel J.","year":"1994","unstructured":"J. Thiel and S. Voss . Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms . INFOR , 32 : 226 -- 242 , 1994 . J. Thiel and S. Voss. Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR, 32:226--242, 1994.","journal-title":"INFOR"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.5555\/1642090.1642136"},{"key":"e_1_3_2_1_32_1","first-page":"365","volume-title":"D.-Z. Du","author":"Wah B. W.","year":"1997","unstructured":"B. W. Wah and Y. Shang . A discrete Lagrangian-based global-search method for solving satisfiability problems . In D.-Z. Du , J. Gu, and P. Pardalos, editors, Satisfiability Problem : Theory and Applications, pages 365 -- 392 . DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society , 1997 . B. W. Wah and Y. Shang. A discrete Lagrangian-based global-search method for solving satisfiability problems. In D.-Z. Du, J. Gu, and P. Pardalos, editors, Satisfiability Problem: Theory and Applications, pages 365--392. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, 1997."},{"key":"e_1_3_2_1_33_1","first-page":"28","volume-title":"Principles and Practice of Constraint Programming","author":"Wah B. W.","year":"1999","unstructured":"B. W. Wah and Z. Wu . The theory of discrete Lagrange multipliers for nonlinear discrete optimization . In Principles and Practice of Constraint Programming , pages 28 -- 42 , 1999 . B. W. Wah and Z. Wu. The theory of discrete Lagrange multipliers for nonlinear discrete optimization. In Principles and Practice of Constraint Programming, pages 28--42, 1999."}],"event":{"sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation","ACM Association for Computing Machinery"],"acronym":"GECCO05","name":"GECCO05: Genetic and Evolutionary Computation Conference","location":"Washington DC USA"},"container-title":["Proceedings of the 7th annual conference on Genetic and evolutionary computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068114","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1068009.1068114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:07:59Z","timestamp":1750262879000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1068009.1068114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,6,25]]},"references-count":31,"alternative-id":["10.1145\/1068009.1068114","10.1145\/1068009"],"URL":"https:\/\/doi.org\/10.1145\/1068009.1068114","relation":{},"subject":[],"published":{"date-parts":[[2005,6,25]]},"assertion":[{"value":"2005-06-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}