{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:19Z","timestamp":1759847539660},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1007\/bf01586048","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:35:49Z","timestamp":1114677349000},"page":"127-153","source":"Crossref","is-referenced-by-count":18,"title":["Local minima for indefinite quadratic knapsack problems"],"prefix":"10.1007","volume":"54","author":[{"given":"Stephen A.","family":"Vavasis","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1287\/mnsc.27.4.431","volume":"27","author":"G.R. Bitran","year":"1981","unstructured":"G.R. Bitran and A.C. Hax, \u201cDisaggregation and resource allocation using convex knapsack problems with bounded variables,\u201dManagement Science 27 (1981) 431\u2013441.","journal-title":"Management Science"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P. Brucker","year":"1984","unstructured":"P. Brucker, \u201cAn O(n) algorithm for quadratic knapsack problems,\u201dOperations Research Letters 3 (1984) 163\u2013166.","journal-title":"Operations Research Letters"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1434","DOI":"10.1137\/0724092","volume":"24","author":"P.H. Calamai","year":"1987","unstructured":"P.H. Calamai and J.J. Mor\u00e9, \u201cQuasi-Newton updates with bounds,\u201dSIAM Journal on Numerical Analysis 24 (1987) 1434\u20131441.","journal-title":"SIAM Journal on Numerical Analysis"},{"key":"CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle and L.J. Guibas, \u201cVisibility and intersection problems in plane geometry,\u201dACM Symposium on Computational Geometry, 1985, pp. 135\u2013146.","DOI":"10.1145\/323233.323252"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/nav.3800330106","volume":"33","author":"R.W. Cottle","year":"1986","unstructured":"R.W. Cottle, S.G. Duval and K. Zikan, \u201cA Lagrangean relaxation algorithm for the constrained matrix problem,\u201dNaval Research Logistics Quarterly 33 (1986) 55\u201376.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR6","volume-title":"Practical Methods of Optimization, Vol. 2","author":"R. Fletcher","year":"1981","unstructured":"R. Fletcher,Practical Methods of Optimization, Vol. 2 (Wiley, Chichester, 1981)."},{"key":"CR7","volume-title":"Practical Optimization","author":"P.E. Gill","year":"1981","unstructured":"P.E. Gill, W. Murray and M.H Wright,Practical Optimization (Academic Press, London, 1981)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/BF01588328","volume":"18","author":"R. Helgason","year":"1980","unstructured":"R. Helgason, J. Kennington and H. Lall, \u201cA polynomially bounded algorithm for a singly constrained quadratic program,\u201dMathematical Programming 18 (1980) 338\u2013343.","journal-title":"Mathematical Programming"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","volume":"37","author":"D.S. Johnson","year":"1988","unstructured":"D.S. Johnson, C.H. Papadimitriou and M. Yannakakis, \u201cHow easy is local search?\u201dJournal of Computer and System Sciences 37 (1988) 79\u2013100.","journal-title":"Journal of Computer and System Sciences"},{"key":"CR10","unstructured":"M.W. Krentel, \u201cOn finding locally optimal solutions,\u201d to appear inSIAM Journal on Computing."},{"key":"CR11","first-page":"150","volume":"8","author":"R. Kurata","year":"1966","unstructured":"R. Kurata, \u201cNotes on parametric quadratic programming,\u201dJournal of the Operations Research Society of Japan 8 (1966) 150\u2013153.","journal-title":"Journal of the Operations Research Society of Japan"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1002\/nav.3800030110","volume":"3","author":"H.M. Markowitz","year":"1956","unstructured":"H.M. Markowitz, \u201cThe optimization of a quadratic function subject to linear constraints,\u201dNaval Research Logistics. Quarterly 3 (1956) 111\u2013133.","journal-title":"Naval Research Logistics. Quarterly"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/BF01588800","volume":"49","author":"J.J. Mor\u00e9","year":"1991","unstructured":"J.J. Mor\u00e9 and S.A. Vavasis, \u201cOn the solution of concave knapsack problems,\u201dMathematical Programming 49 (1991) 397\u2013411.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","volume":"39","author":"K.G. Murty","year":"1987","unstructured":"K.G. Murty and S.N. Kabadi, \u201cSome NP-complete problems in quadratic and nonlinear programming,\u201dMathematical Programming 39 (1987) 117\u2013129.","journal-title":"Mathematical Programming"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","volume":"46","author":"P.M. Pardalos","year":"1990","unstructured":"P.M. Pardalos and N. Kovoor, \u201cAn algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds,\u201dMathematical Programming 46 (1990) 321\u2013328.","journal-title":"Mathematical Programming"},{"key":"CR16","volume-title":"\u201cAlgorithms for the solution of quadratic knapsack problems,\u201d Technical Report CS-89-10","author":"P.M. Pardalos","year":"1989","unstructured":"P.M. Pardalos, Y. Ye and C.-G. Han, \u201cAlgorithms for the solution of quadratic knapsack problems,\u201d Technical Report CS-89-10 Department of Computer Science Pennsylvania State University (University Park, PA, 1989)."},{"key":"CR17","unstructured":"P.M. Pardalos and G.P. Rodgers, \u201cA branch and bound algorithm for the maximum clique problem,\u201dMathematical Programming, to appear."},{"key":"CR18","volume-title":"Combinatorial Optimization","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization (Prentice Hall, Englewood Cliffs, NJ, 1982)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1137\/0203021","volume":"3","author":"S. Sahni","year":"1974","unstructured":"S. Sahni, \u201cComputationally related problems,\u201dSIAM Journal on Computing 3 (1974) 262\u2013279.","journal-title":"SIAM Journal on Computing"},{"key":"CR20","volume-title":"Simple local search problems that are hard to solve","author":"A.A. Sch\u00e4ffer","year":"1989","unstructured":"A.A. Sch\u00e4ffer and M. Yannakakis, \u201cSimple local search problems that are hard to solve,\u201d unpublished manuscript, Rice University (Houston, TX, 1989)."},{"key":"CR21","doi-asserted-by":"crossref","unstructured":"J. Sun, \u201cTracing the characteristic curve of a quadratic black box,\u201d unpublished manuscript. Also, \u201cOn a quadratic program with a single parameter,\u201d Third SIAM Optimization Conference, Boston MA 1989, poster presentation.","DOI":"10.1002\/net.3230190603"},{"key":"CR22","volume-title":"Methods for Linear and Quadratic Programming","author":"C. Panne van de","year":"1975","unstructured":"C. van de Panne,Methods for Linear and Quadratic Programming (North-Holland, Amsterdam, 1975)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586048.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01586048\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01586048","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:46:44Z","timestamp":1586231204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01586048"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":22,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["BF01586048"],"URL":"https:\/\/doi.org\/10.1007\/bf01586048","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}