{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T14:26:42Z","timestamp":1774708002139,"version":"3.50.1"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,4,21]],"date-time":"2007-04-21T00:00:00Z","timestamp":1177113600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,2]]},"DOI":"10.1007\/s10878-007-9074-4","type":"journal-article","created":{"date-parts":[[2007,4,20]],"date-time":"2007-04-20T21:01:00Z","timestamp":1177102860000},"page":"165-178","source":"Crossref","is-referenced-by-count":64,"title":["Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem"],"prefix":"10.1007","volume":"15","author":[{"given":"Yannick","family":"Vimont","sequence":"first","affiliation":[]},{"given":"Sylvain","family":"Boussier","sequence":"additional","affiliation":[]},{"given":"Michel","family":"Vasquez","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,4,21]]},"reference":[{"issue":"1","key":"9074_CR1","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"PC Chu","year":"1998","unstructured":"Chu PC, Beasley JE (1998) A genetic algorithm for the multidimensional knapsack problem. J Heuristics 4(1):63\u201386","journal-title":"J Heuristics"},{"key":"9074_CR2","volume-title":"Linear programming","author":"V Chv\u00e1tal","year":"1983","unstructured":"Chv\u00e1tal V (1983) Linear programming. Freeman, New York"},{"issue":"3","key":"9074_CR3","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","volume":"28","author":"D Fayard","year":"1982","unstructured":"Fayard D, Plateau G (1982) An algorithm for the solution of the 0\u20131 knapsack problem. Computing 28(3):269\u2013287","journal-title":"Computing"},{"key":"9074_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(03)00274-1","volume":"155","author":"A Fr\u00e9ville","year":"2004","unstructured":"Fr\u00e9ville A (2004) The multidimensional 0\u20131 knapsack problem: an overview. Eur J Oper Res 155:1\u201321","journal-title":"Eur J Oper Res"},{"key":"9074_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0166-218X(94)90209-7","volume":"49","author":"A Fr\u00e9ville","year":"1994","unstructured":"Fr\u00e9ville A, Plateau G (1994) An efficient preprocessing procedure for the multidimensional 0\u20131 knapsack problem. Discret Appl Math 49:189\u2013212","journal-title":"Discret Appl Math"},{"key":"9074_CR6","doi-asserted-by":"crossref","unstructured":"James RJW, Nakagawa Y (2005) Enumeration methods for repeatedly solving multidimensional knapsack sub-problems. Technical report E88-D, 10:83-103, The Institute of Electronics, Information and Communication Engineers","DOI":"10.1093\/ietisy\/e88-d.10.2329"},{"key":"9074_CR7","unstructured":"Oliva C, Michelon P, Artigues C (2001) Constraint and linear programming: using reduced costs for solving the zero\/one multiple knapsack problem. In International conference on constraint programming, CP 01, proceedings of the workshop on cooperative solvers in constraint programming (CoSolv 01), pp\u00a087\u201398"},{"key":"9074_CR8","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1109\/TSSC.1970.300288","volume":"6","author":"RM Saunders","year":"1970","unstructured":"Saunders RM, Schinzinger R (1970) A shrinking boundary algorithm for discrete system models. IEEE Trans Syst Sci Cybern 6:133\u2013140","journal-title":"IEEE Trans Syst Sci Cybern"},{"key":"9074_CR9","unstructured":"Vasquez M, Hao JK (2001) An hybrid approach for the 0\u20131 multidimensional knapsack problem. In Proceedings of the 17th international joint conference on artificial intelligence, IJCAI-01, Seattle, WA"},{"issue":"1","key":"9074_CR10","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.ejor.2004.01.024","volume":"165","author":"M Vasquez","year":"2005","unstructured":"Vasquez M, Vimont Y (2005) Improved results on the 0-1 multidimensional knapsack problem. Eur J Oper Res 165(1):70\u201381","journal-title":"Eur J Oper Res"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9074-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9074-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9074-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:18:11Z","timestamp":1559276291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9074-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,4,21]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,2]]}},"alternative-id":["9074"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9074-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,4,21]]}}}