{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T14:09:24Z","timestamp":1773324564585,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10732-005-2634-9","type":"journal-article","created":{"date-parts":[[2005,10,11]],"date-time":"2005-10-11T12:27:54Z","timestamp":1129033674000},"page":"465-481","source":"Crossref","is-referenced-by-count":18,"title":["Very Large-Scale Neighborhood Search for the K-Constraint Multiple Knapsack Problem"],"prefix":"10.1007","volume":"11","author":[{"given":"Ravindra K.","family":"Ahuja","sequence":"first","affiliation":[]},{"given":"Claudio B.","family":"Cunha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2634_CR1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"R.K. Ahuja","year":"1993","unstructured":"Ahuja, R.K., T.L. Magnanti, and J.B. Orlin. (1993). Network Flows: Theory, Algorithms, and Applications. New Jersey: Prentice Hall."},{"key":"2634_CR2","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1016\/S0305-0548(99)00067-2","volume":"27","author":"R.K. Ahuja","year":"2000","unstructured":"Ahuja, R.K., J.B. Orlin, and A. Tiwari. (2000). \u201cA Greedy Genetic Algorithm for the Quadratic Assignment Problem.\u201d Computers and Operations Research 27, 917\u2013934.","journal-title":"Computers and Operations Research"},{"key":"2634_CR3","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s101070100234","volume":"91","author":"R.K. Ahuja","year":"2001","unstructured":"Ahuja, R.K., J.B. Orlin, and D. Sharma. (2001). \u201cMulti-Exchange Neighborhood Search Algorithms for the Capacitated Minimum Spanning Tree Problem.\u201d Mathematical Programming 91, 71\u201397.","journal-title":"Mathematical Programming"},{"key":"2634_CR4","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., O. Ergun, J.B. Orlin, and A.P. Punnen. (2002a). \u201cA Survey of Very Large Scale Neighborhood Search Techniques.\u201d Discrete Applied Mathematics 123, 75\u2013102.","DOI":"10.1016\/S0166-218X(01)00338-9"},{"key":"2634_CR5","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., K.C. Jha, J.B. Orlin, and D. Sharma. (2002b). \u201cVery Large-Scale Neighborhood Search Algorithms for the Quadratic Assignment Problem.\u201d INFORMS Journal on Computing (to appear).","DOI":"10.2139\/ssrn.337600"},{"key":"2634_CR6","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., A. Kumar, K.C. Jha, and J.B. Orlin. (2003a). \u201cExact and Heuristic Methods for the Weapon Target Assignment Problem.\u201d Submitted to Operations Research.","DOI":"10.2139\/ssrn.489802"},{"key":"2634_CR7","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/S0167-6377(02)00236-5","volume":"31","author":"R.K. Ahuja","year":"2003b","unstructured":"Ahuja, R.K., J.B. Orlin, and D. Sharma. (2003b). \u201cA Composite Neighborhood Search Algorithm for the Capacitated Minimum Spanning Tree Problem,\u201d Operations Research Letters 31, 185\u2013194.","journal-title":"Operations Research Letters"},{"key":"2634_CR8","doi-asserted-by":"crossref","unstructured":"Ahuja, R.K., J.B. Orlin, S. Pallotino, M.P. Scaparra, and M.G Scutell\u00e0. (2003c). \u201cA Multi-Exchange Heuristic for the Capacitated Facility Location Problem.\u201d Management Science (to appear).","DOI":"10.2139\/ssrn.337621"},{"key":"2634_CR9","doi-asserted-by":"crossref","unstructured":"Barcel\u00f3, J. and J. Casanovas. (1984). \u201dA Heuristic Lagrangean Algorithm for the Capacitated Plant Location Problem.\u201d European Journal of Operational Research15, 212\u2013226.","DOI":"10.1016\/0377-2217(84)90211-X"},{"key":"2634_CR10","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1023\/A:1009642405419","volume":"4","author":"P.C. Chu","year":"1998","unstructured":"Chu, P.C. and J.E. Beasley. (1998). \u201cA Genetic Algorithm for the Multidimensional Knapsack Problem.\u201d Journal of Heuristics 4, 63\u201388.","journal-title":"Journal of Heuristics"},{"key":"2634_CR11","doi-asserted-by":"crossref","unstructured":"Cord, J. (1964). \u201cA Method for Allocating Funds to Investment Projects When Returns are Subject to Uncertainty.\u201d Management Science10(2), 335\u2013341.","DOI":"10.1287\/mnsc.10.2.335"},{"key":"2634_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02242185","volume":"40","author":"A. Drexl","year":"1988","unstructured":"Drexl, A. (1988). \u201cA Simulated Annealing Approach for the Multiconstraint Zero-One Knapsack Problem.\u201d Computing 40, 1\u20138.","journal-title":"Computing"},{"key":"2634_CR13","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1016\/S0167-6377(02)00124-4","volume":"30","author":"V. Gabrel","year":"2002","unstructured":"Gabrel, V. and M. Minoux. (2002). \u201cA Scheme for Exact Separation of Extended Cover Inequalities and Application to Multidimensional Knapsack Problems.\u201d Operations Research Letters 30, 252\u2013264.","journal-title":"Operations Research Letters"},{"key":"2634_CR14","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/BF02591863","volume":"31","author":"B. Gavish","year":"1985","unstructured":"Gavish, B. and H. Pirkul. (1985). \u201cEfficient Algorithms for Solving Multi-Constraint Zero-One Knapsack Problems to Optimality.\u201d Mathematical Programming 31, 78\u2013105.","journal-title":"Mathematical Programming"},{"key":"2634_CR15","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1287\/mnsc.20.4.487","volume":"20","author":"C.E. Gearing","year":"1973","unstructured":"Gearing, C.E., W.W. Swart, and T. Var. (1973). \u201cDetermining the Optimal Investment Policy for the Tourism Sector of a Developing Country.\u201d Management Science 20, 487\u2013497.","journal-title":"Management Science"},{"key":"2634_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F. and M. Laguna. (1997). Tabu Search. Norwell, MA: Kluwer Academic Publishers."},{"key":"2634_CR17","unstructured":"Lokkentagen, A. and F. Glover. (1996). \u201cProbabilistic Move Selection in Tabu Search for Zero-One Mixed Integer Programming Problems.\u201d In I.H. Osman nd K.P. Kelly (eds.), Meta-Heuristics: Theory and Applications. Kluwer Academic Publishers, pp. 467-487."},{"key":"2634_CR18","unstructured":"Martello, S. and P. Toth. (1990). Knapsack Problems: Algorithms and Computer Implementations. Wiley, Chichester, UK."},{"key":"2634_CR19","doi-asserted-by":"crossref","unstructured":"Martello, S. and P. Toth. (2003). \u201cAn Exact Algorithm for the Two-Constraint 0-1 Knapsack Problem.\u201d Operations Research 51(5), 826\u2013835.","DOI":"10.1287\/opre.51.5.826.16757"},{"key":"2634_CR20","doi-asserted-by":"crossref","unstructured":"Petersen, C.C. (1967). \u201cComputational Experience with Variants of the Balas Algorithm Applied to the Selection of R&D Projects.\u201d Management Science13(9), 736\u2013750.","DOI":"10.1287\/mnsc.13.9.736"},{"key":"2634_CR21","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/S0166-218X(96)00123-0","volume":"76","author":"E. Pesch","year":"1997","unstructured":"Pesch, E. and F. Glover. (1997). \u201cTSP Ejection Chains.\u201d Discrete Applied Mathematics 76, 165\u2013181.","journal-title":"Discrete Applied Mathematics"},{"key":"2634_CR22","doi-asserted-by":"crossref","unstructured":"Pisinger, D. (1999). An Exact Algorithm for Large Multiple Knapsack Problems. European Journal of Operational Research 114, 528\u2013541.","DOI":"10.1016\/S0377-2217(98)00120-9"},{"key":"2634_CR23","unstructured":"Sinha, K.C, T. Kaji, and C.C. Liu. (1981). \u201cOptimal Allocation of Funds for Highway Safety Improvement Projects.\u201d Transportation Research Record 808, 24\u201330."},{"key":"2634_CR24","unstructured":"Thompson, P.M. and J.B. Orlin. (1989). \u201cThe Theory of Cyclic Transfers\u201d. MIT Operations Research Report 200\u201389, Cambridge, MA."},{"key":"2634_CR25","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P.M. Thompson","year":"1993","unstructured":"Thompson, P.M. and H.N. Psaraftis. (1993). \u201cCyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems.\u201d Operations Research 41, 935\u2013946.","journal-title":"Operations Research"},{"key":"2634_CR26","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1287\/opre.15.1.83","volume":"15","author":"H.M. Weingartner","year":"1967","unstructured":"Weingartner, H.M. and D.N. Ness. (1967). \u201cMethods for the Solution of the Multidimensional 0\/1 Knapsack Problem.\u201d Operations Research 15, 83\u2013103.","journal-title":"Operations Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-2634-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-005-2634-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-005-2634-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T07:37:45Z","timestamp":1586504265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-005-2634-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":26,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["2634"],"URL":"https:\/\/doi.org\/10.1007\/s10732-005-2634-9","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}