{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,20]],"date-time":"2025-05-20T04:03:09Z","timestamp":1747713789195,"version":"3.40.5"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,3,1]],"date-time":"2002-03-01T00:00:00Z","timestamp":1014940800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Heuristics"],"published-print":{"date-parts":[[2002,3]]},"DOI":"10.1023\/a:1017964608086","type":"journal-article","created":{"date-parts":[[2002,12,30]],"date-time":"2002-12-30T14:36:44Z","timestamp":1041259004000},"page":"215-239","source":"Crossref","is-referenced-by-count":6,"title":["Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem"],"prefix":"10.1007","volume":"8","author":[{"given":"F. Sibel","family":"Salman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jayant R.","family":"Kalagnanam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sesh","family":"Murthy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Davenport","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"395998_CR1","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R. Battiti","year":"1994","unstructured":"Battiti, R. and G. Tecchiolli. (1994). \u201cThe Reactive Tabu Search.\u201d ORSA Journal on Computing 6(2), 120\u2013140.","journal-title":"ORSA Journal on Computing"},{"key":"395998_CR2","first-page":"49","volume-title":"Algorithm Design for Computer System Design","author":"E. Coffman","year":"1984","unstructured":"Coffman, E., M. Garey, and D. Johnson. (1984). \u201cApproximation Algorithms for Binpacking: An Updated Survey.\u201d In G. Ausiello, M. Lucertini, and P. Serafini (eds.), Algorithm Design for Computer System Design. Wien: Springer-Verlag, pp. 49\u2013106."},{"key":"395998_CR3","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"E. Coffman","year":"1997","unstructured":"Coffman, E., M. Garey, and D. Johnson. (1997). \u201cApproximation Algorithms for Binpacking: A Survey.\u201d In D. Hochbaum (ed.), Approximation Algorithms for NP-hard Problems. Boston: PWS Publishing Company, pp. 46\u201393."},{"key":"395998_CR4","unstructured":"CPLEX (1994). \u201cUsing the CPLEX Linear Optimizer.\u201d CPLEX Optimization Inc."},{"key":"395998_CR5","series-title":"Technical Report","volume-title":"Approximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions","author":"M. Dawande","year":"1998","unstructured":"Dawande, M., J. Kalagnanam, P. Keskinocek, R. Ravi, and F.S. Salman. (1998). \u201cApproximation Algorithms for the Multiple Knapsack Problem with Assignment Restrictions.\u201d Technical Report, IBM T. J. Watson Research Center, P.O. Box 18, Yorktown Heights, New York 10598, USA."},{"key":"395998_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1145\/356810.356816","volume":"12","author":"L.D. Erman","year":"1980","unstructured":"Erman, L.D., F.A. Hayes-Roth, V.R. Lesser, and D.R. Reddy. (1980). \u201cThe Hearsay-II Speech-Understanding System: Integrating Knowledge to Resolve Uncertainty.\u201d Computing Surveys 12, 213\u2013253.","journal-title":"Computing Surveys"},{"issue":"3","key":"395998_CR7","doi-asserted-by":"crossref","first-page":"858","DOI":"10.1137\/S1052623493254455","volume":"6","author":"C. Ferreira","year":"1996","unstructured":"Ferreira, C., A. Martin, and R. Weismantel. (1996). \u201cSolving Multiple Knapsack Problems by Cutting Planes.\u201d SIAM J. Optimization 6(3), 858\u2013877.","journal-title":"SIAM J. Optimization"},{"key":"395998_CR8","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1137\/0215016","volume":"15","author":"D. Friesen","year":"1986","unstructured":"Friesen, D. and M. Langston. (1986). \u201cVariable Sized Bin Packing.\u201d SIAM J. Computing 15, 222\u2013230.","journal-title":"SIAM J. Computing"},{"key":"395998_CR9","volume-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"Garey, M. and D. Johnson. (1979). Computers and Intractibility: A Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman and Co."},{"issue":"3","key":"395998_CR10","first-page":"109","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search Part I.\u201d Operations Research Society of America (ORSA) Journal on Computing 1(3), 109\u2013206.","journal-title":"Operations Research Society of America (ORSA) Journal on Computing"},{"issue":"1","key":"395998_CR11","first-page":"4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search Part II.\u201d Operations Research Society of America (ORSA) Journal on Computing 2(1), 4\u201332.","journal-title":"Operations Research Society of America (ORSA) Journal on Computing"},{"key":"395998_CR12","unstructured":"Gomes, C.P. and B. Selman. (1997). \u201cAlgorithm Portfolio Design: Theory vs. Practice.\u201d In Proc. Uncertainty in Artificial Intelligence."},{"key":"395998_CR13","volume-title":"Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H. (1975). Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. Ann Arbor, MI: University of Michigan Press."},{"key":"395998_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1126\/science.275.5296.51","volume":"265","author":"B.A. Huberman","year":"1997","unstructured":"Huberman, B.A., R.M. Lukose, and T. Hogg. (1997). \u201cAn Economics Approach to Hard Computational Problems.\u201d Science 265, 51\u201354.","journal-title":"Science"},{"key":"395998_CR15","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1002\/nav.3800250316","volume":"24","author":"M. Hung","year":"1978","unstructured":"Hung, M. and J. Fisk. (1978). \u201cAn Algorithm for 0-1 Multiple Knapsack Problems.\u201d Naval Res. Logist. Quarterly 24, 571\u2013579.","journal-title":"Naval Res. Logist. Quarterly"},{"key":"395998_CR16","unstructured":"Kalagnanam, J., M. Dawande, M. Trumbo, and H.S. Lee. (1998). \u201cThe Surplus Inventory Matching Problem in the Process Industry.\u201d Technical Report RC21071, IBM T. J. Watson Research Center."},{"key":"395998_CR17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"R. Karp","year":"1972","unstructured":"Karp, R. (1972). \u201cReducibility among Combinatorial Problems.\u201d In R. Miller and J. Thatcher (eds.), Complexity of Computer Computations. New York: Plenum Press, pp. 85\u2013103."},{"key":"395998_CR18","volume-title":"Scheduling Solutions for the Paper Industry","author":"P. Keskinocak","year":"1998","unstructured":"Keskinocak, P., F. Wu, R. Goodwin, S. Murthy, R. Akkiraju, S. Kumaran, and A. Derebail. (1998). \u201cScheduling Solutions for the Paper Industry.\u201d Technical Report, IBM T. J.Watson Research Center, P.O. Box 18, Yorktown Heights, New York 10598."},{"key":"395998_CR19","doi-asserted-by":"crossref","unstructured":"Lee, H., S. Murthy, S. Haider, and D. Morse. (1996). \u201cPrimary Production Scheduling at Steel-Making Industries.\u201d IBM Journal of Research and Development.","DOI":"10.1147\/rd.402.0231"},{"key":"395998_CR20","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1016\/0377-2217(80)90143-5","volume":"4","author":"S. Martello","year":"1980","unstructured":"Martello, S. and P. Toth. (1980). \u201cSolution of the Zero-One Multiple Knapsack Problem.\u201d Euro. J. Oper. Res. 4, 322\u2013329.","journal-title":"Euro. J. Oper. Res."},{"key":"395998_CR21","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/0166-218X(81)90005-6","volume":"3","author":"S. Martello","year":"1981","unstructured":"Martello, S. and P. Toth. (1981a). \u201cA Bound and Bound Algorithm for the Zero-One Multiple Knapsack Problem.\u201d Discrete Applied Math. 3, 275\u2013288.","journal-title":"Discrete Applied Math."},{"key":"395998_CR22","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BF02243544","volume":"27","author":"S. Martello","year":"1981","unstructured":"Martello, S. and P. Toth. (1981b). \u201cHeuristic Algorithms for the Multiple Knapsack Problem.\u201d Computing 27, 93\u2013112.","journal-title":"Computing"},{"key":"395998_CR23","volume-title":"Knapsack Problems","author":"S. Martello","year":"1989","unstructured":"Martello, S. and P. Toth. (1989). Knapsack Problems. New York: John Wiley and Sons."},{"key":"395998_CR24","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0166-218X(90)90094-S","volume":"28","author":"S. Martello","year":"1990","unstructured":"Martello, S. and P. Toth. (1990). Lower Bounds and Reduction Procedures for the Bin Packing Problem. Discrete Applied Math. 28, 59\u201370.","journal-title":"Discrete Applied Math."},{"key":"395998_CR25","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-009-0909-0","volume-title":"Bayesian Approach to Global Optimization","author":"J. Mockus","year":"1989","unstructured":"Mockus, J. (1989). Bayesian Approach to Global Optimization. Dordrecht: Kluwer Academic Publishers."},{"key":"395998_CR26","unstructured":"Murthy, S. (1992). \u201cSynergy in Cooperating Agents: Designing Manipulators from Task Specifications.\u201d Ph.D. Thesis, Dept. of Electrical and Computer Engineering, Carnegie Mellon University."},{"key":"395998_CR27","unstructured":"Murthy, S., R. Akkiraju, J. Rachlin, and F. Wu. (1997). \u201cAgent-Based Cooperative Scheduling.\u201d In E.C. Charniak (ed.), Constraints and Agents, AAAI-97 Workshop, pp. 112\u2013117."},{"key":"395998_CR28","volume-title":"Leda User Manual","author":"S. N\u00e4her","year":"1995","unstructured":"N\u00e4her, S. and C. Uhrig. (1995). Leda User Manual. Saarbr\u00fccken, Germany: Max-Planck-Institute f\u00fcr Informatik."},{"key":"395998_CR29","doi-asserted-by":"crossref","unstructured":"Rodosek, R., M.G. Wallace, and M.T. Hajian. (1999). \u201cANewApproach to Integrating Mixed Integer Programming with Constraint Logic Programming.\u201d In Annals of Operational Research: Recent Advances in Combinatorial Optimization: Theory and Applications.","DOI":"10.1023\/A:1018904229454"},{"key":"395998_CR30","doi-asserted-by":"crossref","first-page":"539","DOI":"10.1057\/jors.1990.78","volume":"41","author":"S.F. Smith","year":"1990","unstructured":"Smith, S.F., P.S. Ow, J. Potwin, N. Muscettola, and D.C. Matthys. (1990). \u201cAn Integrated Framework for Generating and Revising Factory Schedules.\u201d Journal of the Operational Research Society 41, 539\u2013552.","journal-title":"Journal of the Operational Research Society"},{"key":"395998_CR31","doi-asserted-by":"crossref","unstructured":"Talukdar, S. and P. de Souza. (1993). \u201cAsynchronous Organizations for Multi-Algorithm Problems.\u201d In E. Deaton, H. George, K.M. Bergel, and G. Hedrick (eds.), Proceeding of 8th SIGAPP Symposium on Applied Computing, pp. 286\u2013293.","DOI":"10.1145\/162754.162902"},{"key":"395998_CR32","unstructured":"Talukdar, S., P. de Souza, and S. Murthy. (1993). \u201cOrganizations for Computer-Based Agents.\u201d Engineering Intelligent Systems 1(2)."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017964608086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1017964608086\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1017964608086.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:57:51Z","timestamp":1747652271000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1017964608086"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,3]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,3]]}},"alternative-id":["395998"],"URL":"https:\/\/doi.org\/10.1023\/a:1017964608086","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2002,3]]}}}