{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:58:13Z","timestamp":1773615493859,"version":"3.50.1"},"reference-count":11,"publisher":"Allerton Press","issue":"6","license":[{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2007,12,1]],"date-time":"2007-12-01T00:00:00Z","timestamp":1196467200000},"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":["Aut. Conrol Comp. Sci."],"published-print":{"date-parts":[[2007,12]]},"DOI":"10.3103\/s014641160706003x","type":"journal-article","created":{"date-parts":[[2008,1,22]],"date-time":"2008-01-22T08:51:27Z","timestamp":1200991887000},"page":"312-319","source":"Crossref","is-referenced-by-count":0,"title":["Methods of constructing suboptimal solutions of integer programming problems and successive improvement of these solutions"],"prefix":"10.3103","volume":"41","author":[{"given":"K. Sh.","family":"Mamedov","sequence":"first","affiliation":[]},{"given":"S. Ya.","family":"Huseynov","sequence":"additional","affiliation":[]}],"member":"1627","reference":[{"key":"6003_CR1","volume-title":"Diskretnoe Programmirovanie","author":"A.A. Korbut","year":"1969","unstructured":"Korbut, A.A. and Finkel\u2019shteyn, Yu.Yu., Diskretnoe Programmirovanie (Discrete Programming), Moscow: Nauka, 1969."},{"key":"6003_CR2","volume-title":"Metod Postroeniya Posledovatel\u2019nosti Planov dlya Resheniya Zadach Diskretnoy Optimizatsii","author":"V.A. Emelichev","year":"1981","unstructured":"Emelichev, V.A. and Komlik, V.N., Metod Postroeniya Posledovatel\u2019nosti Planov dlya Resheniya Zadach Diskretnoy Optimizatsii (A Method of Constructing Sequences of Designs for the Solution of Problems of Discrete Optimization), Moscow: Nauka, 1981."},{"key":"6003_CR3","volume-title":"Diskretnaya Optimizatsiya (Tselochislennoe Programmirovanie)","author":"M.M. Kovalev","year":"2003","unstructured":"Kovalev, M.M., Diskretnaya Optimizatsiya (Tselochislennoe Programmirovanie) (Discrete Optimization. Numerical Programming), Moscow: URSS, 2003."},{"key":"6003_CR4","volume-title":"Matematicheskie Modeli i Melody Resheniya Zadach Diskretnoy Optimizatsii","author":"I.V. Sergienko","year":"1988","unstructured":"Sergienko, I.V., Matematicheskie Modeli i Melody Resheniya Zadach Diskretnoy Optimizatsii (Mathematical Models and Methods for the Solution of Problems of Discrete Optimization), Kiev: Nauk. Dumka, 1988."},{"key":"6003_CR5","volume-title":"Theory of Linear and Integer Programming","author":"A. Schriyver","year":"1986","unstructured":"Schriyver, A., Theory of Linear and Integer Programming, New York\/Chichester: Wiley & Sons, 1986."},{"key":"6003_CR6","volume-title":"Knapsack Problems. Algorithms and Computer Implementation","author":"S. Mortello","year":"1990","unstructured":"Mortello, S. and Toth, P., Knapsack Problems. Algorithms and Computer Implementation, New York\/Chichester: Wiley & Sons, 1990."},{"key":"6003_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kelleher","year":"2004","unstructured":"Kelleher, H., Pferschy, U., and Pisinger, D., Knapsack Problems, Berlin\/Heidelberg: Springer-Verlag, 2004."},{"issue":"6","key":"6003_CR8","first-page":"143","volume":"28","author":"Dzh. A. Babaev","year":"1978","unstructured":"Babaev, Dzh. A., Mamedov, K.Sh., and Mekhtiev, M.G., Methods for the Construction of Suboptinmal Solutions of the Multidimensional Knapsack Problem, Vychisl. Matem. Matem. Fiz., 1978, vol. 28, no. 6, pp. 143\u2013153.","journal-title":"Vychisl. Matem. Matem. Fiz."},{"key":"6003_CR9","unstructured":"Nuriev, U.G., On an Algorithm for the Solution of the Multidimensional Knapsack Problem, Izv. Akad. Nauk Azerb. Ser. Fiz. Tech. i Matem. Nauk, 2001, no. 2."},{"key":"6003_CR10","unstructured":"Mamedov, K.Sh. and Musaev, T.M., Methods for the Construction of Approximate Solutions of the Multidimensional Knapsack Problem and for Finding an Upper Bound of the Optimum, Avtom. Vychisl. Tekh. (Riga), 2004, no. 5, pp. 72\u201382 [Autom. Control Comput. Sci., 2004, no. 5]."},{"key":"6003_CR11","unstructured":"Huseynov, S.Ya., Certain Algorithms for Finding Suboptimal Solutions of Boolean Programming Problems, Izv. Nats. Akad. Nauk Azerb. Ser. Fiz. Tech. i Matem. Nauk, 2003, no. 3, pp. 109\u2013112."}],"container-title":["Automatic Control and Computer Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641160706003X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.3103\/S014641160706003X","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641160706003X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.3103\/S014641160706003X.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:00:38Z","timestamp":1773612038000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.3103\/S014641160706003X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":11,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,12]]}},"alternative-id":["6003"],"URL":"https:\/\/doi.org\/10.3103\/s014641160706003x","relation":{},"ISSN":["0146-4116","1558-108X"],"issn-type":[{"value":"0146-4116","type":"print"},{"value":"1558-108X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}