{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:11:05Z","timestamp":1761621065626},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,1]],"date-time":"2011-06-01T00:00:00Z","timestamp":1306886400000},"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":[[2013,8]]},"DOI":"10.1007\/s10732-011-9175-1","type":"journal-article","created":{"date-parts":[[2011,5,31]],"date-time":"2011-05-31T15:17:22Z","timestamp":1306855042000},"page":"573-589","source":"Crossref","is-referenced-by-count":3,"title":["Quadratic bottleneck knapsack problems"],"prefix":"10.1007","volume":"19","author":[{"given":"Ruonan","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abraham P.","family":"Punnen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,1]]},"reference":[{"key":"9175_CR1","doi-asserted-by":"crossref","first-page":"62","DOI":"10.1016\/0377-2217(84)90262-5","volume":"18","author":"Y.P. Aneja","year":"1984","unstructured":"Aneja, Y.P., Aggarwal, V., Nair, K.P.K.: On a class of quadratic programs. Eur. J. Oper. Res. 18, 62\u201370 (1984)","journal-title":"Eur. J. Oper. Res."},{"key":"9175_CR2","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/0377-2217(94)00229-0","volume":"92","author":"A. Billionnet","year":"1996","unstructured":"Billionnet, A., Calmels, F.: Linear programming for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 92, 310\u2013325 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9175_CR3","doi-asserted-by":"crossref","first-page":"7817","DOI":"10.1016\/j.eswa.2010.12.124","volume":"38","author":"Y. Cai","year":"2011","unstructured":"Cai, Y., Wang, J., Yin, J., Zhou, Y.: Memetic clonal selection algorithm with EDA vaccination for unconstrained binary quadratic programming problems. Expert Syst. Appl. 38, 7817\u20137827 (2011)","journal-title":"Expert Syst. Appl."},{"key":"9175_CR4","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/BFb0083467","volume-title":"Combinatorial Optimization","author":"P. Chailou","year":"1989","unstructured":"Chailou, P., Hansen, P., Mahieu, Y.: Best network flow bound for the quadratic knapsack problem. In: Simeone (ed.) Combinatorial Optimization. Lecture Notes in Mathematics, vol.\u00a0403, pp. 225\u2013235. Springer, Berlin (1989)"},{"key":"9175_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1007\/s002249910009","volume":"33","author":"B. Courcelle","year":"2000","unstructured":"Courcelle, B., Makowsky, J., Rotics, U.: Linear time solvable optimization problems on graphs of bounded clique-width. Theory Comput. Syst. 33, 125\u2013150 (2000)","journal-title":"Theory Comput. Syst."},{"key":"9175_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0167-6377(91)90085-4","volume":"10","author":"C.W. Duin","year":"1991","unstructured":"Duin, C.W., Volgenant, A.: Minimum deviation and balanced optimization: a\u00a0unified approach. Oper. Res. Lett. 10, 43\u201348 (1991)","journal-title":"Oper. Res. Lett."},{"key":"9175_CR7","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/978-1-4615-1507-4_15","volume-title":"Essays and Surveys in Metaheuristics","author":"P. Festa","year":"2002","unstructured":"Festa, P., Resende, M.: GRASP: An annotated bibliography. In: Ribeiro, C., Hansen, P. (eds.) Essays and Surveys in Metaheuristics, pp.\u00a0325\u2013367. Kluwer Academic, Dordrecht (2002)"},{"key":"9175_CR8","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0120892","volume":"12","author":"G. Gallo","year":"1980","unstructured":"Gallo, G., Hammer, P., Simeone, B.: Quadratic knapsack problems. Math. Program. 12, 132\u2013149 (1980)","journal-title":"Math. Program."},{"key":"9175_CR9","volume-title":"Computers and Intractability: A\u00a0Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A\u00a0Guide to the Theory of NP-completeness. Freeman, New York (1979)"},{"key":"9175_CR10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1007\/s10288-009-0115-y","volume":"8","author":"F. Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR-Q. J. Oper. Res. 8, 239\u2013253 (2010)","journal-title":"4OR-Q. J. Oper. Res."},{"key":"9175_CR11","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms Combinatorial Optimization, pp. 273\u2013303. Springer, Berlin (1988)"},{"key":"9175_CR12","first-page":"325","volume":"88","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for perfect graphs. Math. Stud. 88, 325\u2013356 (1984)","journal-title":"Math. Stud."},{"key":"9175_CR13","first-page":"170","volume":"35","author":"P. Hammer","year":"1997","unstructured":"Hammer, P., Rader, D. Jr.: Efficient methods for solving quadratic 0-1 knapsack problems. INFOR 35, 170\u2013182 (1997)","journal-title":"INFOR"},{"key":"9175_CR14","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/0167-6377(87)90021-6","volume":"6","author":"J.P. Hart","year":"1987","unstructured":"Hart, J.P., Shogan, A.W.: Semi-greedy heuristics: an empirical study. Oper. Res. Lett. 6, 107\u2013114 (1987)","journal-title":"Oper. Res. Lett."},{"key":"9175_CR15","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1009898604624","volume":"4","author":"C. Helmberg","year":"2000","unstructured":"Helmberg, C., Rendl, F., Weismantel, R.: A semidefinite programming approach to the quadratic knapsack problem. J. Comb. Optim. 4, 197\u2013215 (2000)","journal-title":"J. Comb. Optim."},{"key":"9175_CR16","doi-asserted-by":"crossref","unstructured":"Kochenberger, G., Hao, J.K., L\u00fc, Z., Wang, H., Glover, F.: Solving large scale max cut problems via tabu search. Technical report (2011)","DOI":"10.1007\/s10732-011-9189-8"},{"key":"9175_CR17","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1016\/0377-2217(95)00299-5","volume":"95","author":"P. Michelon","year":"1996","unstructured":"Michelon, P., Veilleux, L.: Lagrangian methods for the 0-1 quadratic knapsack problem. Eur. J. Oper. Res. 95, 671\u2013682 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"9175_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.7155\/jgaa.00186","volume":"13","author":"U. Pferschy","year":"2009","unstructured":"Pferschy, U., Schauer, J.: The knapsack problem with conflict graphs. J. Graph Algorithms Appl. 13, 233\u2013249 (2009)","journal-title":"J. Graph Algorithms Appl."},{"key":"9175_CR19","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1016\/0305-0548(94)90084-1","volume":"21","author":"A.P. Punnen","year":"1994","unstructured":"Punnen, A.P.: On combined minmax-minsum optimization. Comput. Oper. Res. 21, 707\u2013716 (1994)","journal-title":"Comput. Oper. Res."},{"key":"9175_CR20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1002\/nav.20446","volume":"58","author":"A.P. Punnen","year":"2011","unstructured":"Punnen, A.P., Zhang, R.: Quadratic bottleneck problems. Naval Res. Logist. 58, 153\u2013164 (2011)","journal-title":"Naval Res. Logist."},{"key":"9175_CR21","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/S0167-6377(02)00122-0","volume":"30","author":"D. Rader Jr.","year":"2002","unstructured":"Rader, D., Jr., Woeginger, W.: The quadratic 0-1 knapsack problem with series-parallel support. Oper. Res. Lett. 30, 159\u2013166 (2002)","journal-title":"Oper. Res. Lett."},{"key":"9175_CR22","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1007\/0-306-48056-5_8","volume-title":"Handbook of Metaheuristics","author":"M. Resende","year":"2003","unstructured":"Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger,\u00a0G. (eds.) Handbook of Metaheuristics, pp.\u00a0219\u2013249. Kluwer Academic, Dordrecht (2003)"},{"key":"9175_CR23","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1145\/322326.322328","volume":"29","author":"K. Takamizawa","year":"1982","unstructured":"Takamizawa, K., Nishizeki, T., Saito, N.: Linear-time computability of combinatorial problems on series-parallel graphs. J. ACM 29, 623\u2013641 (1982)","journal-title":"J. ACM"},{"key":"9175_CR24","first-page":"344","volume":"1","author":"H. Wang","year":"2010","unstructured":"Wang, H., Kochenberger, G., Xu, Y.: A\u00a0note on optimal solutions to quadratic knapsack problems. Int. J. Math. Modell. Numer. Optim. 1, 344\u2013351 (2010)","journal-title":"Int. J. Math. Modell. Numer. Optim."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9175-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9175-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9175-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T05:40:25Z","timestamp":1560231625000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9175-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,1]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9175"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9175-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,1]]}}}