{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T01:04:57Z","timestamp":1772759097344,"version":"3.50.1"},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0377-2217(02)00858-5","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T14:55:35Z","timestamp":1048604135000},"page":"46-56","source":"Crossref","is-referenced-by-count":7,"title":["Global optimization and multi knapsack: A percolation algorithm"],"prefix":"10.1016","volume":"154","author":[{"given":"Dominique","family":"Fortin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ider","family":"Tsevendorj","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00858-5_BIB1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","article-title":"A genetic algorithm for the multidimensional knapsack problem","volume":"4","author":"Chu","year":"1998","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB2","article-title":"Dynamic tabu list management using the reverse elimination method","author":"Dammeyer","year":"1991","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","article-title":"A simulated annealing approach to the multiconstraint zero\u2013one knapsack problem","volume":"40","author":"Drexel","year":"1988","journal-title":"Computing"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB4","doi-asserted-by":"crossref","DOI":"10.1007\/BF00247210","article-title":"The 0\u20131 bidimensional knapsack problem: Towards an efficient high level primitive tool","volume":"2","author":"Fr\u00e9ville","year":"1996","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB5","series-title":"Tabu Search","author":"Glover","year":"1997"},{"issue":"2","key":"10.1016\/S0377-2217(02)00858-5_BIB6","first-page":"257","article-title":"On the use of cuts in reverse convex programs","volume":"68","author":"Gurlitz","year":"1991","journal-title":"Annals of Operations Research"},{"issue":"106","key":"10.1016\/S0377-2217(02)00858-5_BIB7","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1016\/S0377-2217(97)00296-8","article-title":"An efficient tabu search approach for the 0\u20131 multidimensional knapsack problem","author":"Hanafi","year":"1998","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB8","series-title":"Global Optimization","author":"Horst","year":"1990"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB9","doi-asserted-by":"crossref","unstructured":"S. Khuri, T. Baeck, J. Heitkoetter, The zero\/one multiple knapsack problem and genetic algorithms, in: ACM Symposium on Applied Computing, SAC\u201994, Phoenix, Arizona, 1994, pp. 188\u2013193","DOI":"10.1145\/326619.326694"},{"issue":"1","key":"10.1016\/S0377-2217(02)00858-5_BIB10","first-page":"6","article-title":"An approach to the solution of integer optimization problems","volume":"39","author":"Kuznetsova","year":"1999","journal-title":"Computational Mathematics and Mathematical Physics"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB11","unstructured":"M.A. Osorio, F. Glover, P. Hammer, Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions, Technical report, HCES-06-00 Report, Hearin Center for Enterprise Science, School of Business, University of Mississippi, 1999"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB12","first-page":"113","article-title":"Extremal problems on complements of convex sets","volume":"1","author":"Strekalovskii","year":"1993","journal-title":"Kibernetika i Sistemnii. Analiz"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB13","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1023\/A:1008260227877","article-title":"Testing the R-strategy for a reverse convex problem","volume":"13","author":"Strekalovskii","year":"1998","journal-title":"Journal of Global Optimization"},{"key":"10.1016\/S0377-2217(02)00858-5_BIB14","unstructured":"I. Tsevendorj, A Problem about Searching a Global Solution in Reverse Convex Problem, PhD thesis, Irkutsk State University, Russia, 1996"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008585?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221702008585?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T17:53:04Z","timestamp":1553449984000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221702008585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0377221702008585"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00858-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}