{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T10:35:49Z","timestamp":1720694149417},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2005,5,1]],"date-time":"2005-05-01T00:00:00Z","timestamp":1114905600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[2005,5]]},"DOI":"10.1016\/j.orl.2004.05.011","type":"journal-article","created":{"date-parts":[[2004,9,21]],"date-time":"2004-09-21T18:24:21Z","timestamp":1095791061000},"page":"312-318","source":"Crossref","is-referenced-by-count":35,"title":["On complexity of unconstrained hyperbolic 0\u20131 programming problems"],"prefix":"10.1016","volume":"33","author":[{"given":"Oleg A.","family":"Prokopyev","sequence":"first","affiliation":[]},{"given":"Hong-Xuan","family":"Huang","sequence":"additional","affiliation":[]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.orl.2004.05.011_bib1","series-title":"Approximation Algorithms for NP-hard Problems","first-page":"399","article-title":"Hardness of approximations","author":"Arora","year":"1996"},{"key":"10.1016\/j.orl.2004.05.011_bib2","first-page":"578","article-title":"The set covering problem with linear fractional functional","volume":"8","author":"Arora","year":"1977","journal-title":"Indian J. Pure Appl. Math."},{"key":"10.1016\/j.orl.2004.05.011_bib3","series-title":"Complexity of Numerical Optimization","first-page":"16","article-title":"The complexity of approximating a nonlinear program","author":"Bellare","year":"1993"},{"issue":"1\u20133","key":"10.1016\/j.orl.2004.05.011_bib4","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","article-title":"Pseudo\u2013Boolean optimization","volume":"123","author":"Boros","year":"2002","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.orl.2004.05.011_bib5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1002\/nav.3800090303","article-title":"Programming with linear fractional functionals","volume":"9","author":"Charnes","year":"1962","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/j.orl.2004.05.011_bib6","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/j.orl.2004.05.011_bib7","series-title":"Boolean Methods in Operations Research and Related Areas","author":"Hammer","year":"1968"},{"key":"10.1016\/j.orl.2004.05.011_bib8","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01531072","article-title":"Boolean query optimization and the 0\u20131 hyperbolic sum problem","volume":"1","author":"Hansen","year":"1990","journal-title":"Ann. Math. Artif. Intell."},{"key":"10.1016\/j.orl.2004.05.011_bib9","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1007\/BF01582890","article-title":"Hyperbolic 0\u20131 programming and query optimization in information retrieval","volume":"52","author":"Hansen","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/j.orl.2004.05.011_bib10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37\/1","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/j.orl.2004.05.011_bib11","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/0377-2217(94)90257-7","article-title":"A global approach for general 0\u20131 fractional programming","volume":"73","author":"Li","year":"1994","journal-title":"European J. Oper. Res."},{"key":"10.1016\/j.orl.2004.05.011_bib12","series-title":"Proceedings of the 23rd Annual Symposium on Foundations of Computer Science","first-page":"14","article-title":"On the complexity of unique solution","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/j.orl.2004.05.011_bib13","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0167-6377(92)90043-3","article-title":"Complexity of uniqueness and local search in quadratic 0\u20131 programming","volume":"11","author":"Pardalos","year":"1992","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/j.orl.2004.05.011_bib14","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1002\/nav.3800220308","article-title":"Solving a (0,1) hyperbolic program by branch and bound","volume":"22","author":"Saipe","year":"1975","journal-title":"Naval Res. Logist. Quart."},{"issue":"1","key":"10.1016\/j.orl.2004.05.011_bib15","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1137\/0220004","article-title":"Simple local search problems that are hard to solve","volume":"20","author":"Schaffer","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/j.orl.2004.05.011_bib16","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1021279918708","article-title":"Global optimization of 0\u20131 hyperbolic programs","volume":"24","author":"Tawarmalani","year":"2002","journal-title":"J. Global Optim."},{"key":"10.1016\/j.orl.2004.05.011_bib17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0304-3975(86)90135-0","article-title":"NP is as easy as detecting unique solutions","volume":"47","author":"Valiant","year":"1986","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/j.orl.2004.05.011_bib18","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1016\/S0377-2217(96)00258-5","article-title":"A note on a global approach for general 0\u20131 fractional programming","volume":"101","author":"Wu","year":"1997","journal-title":"European J. Oper. Res."}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770400094X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S016763770400094X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T08:19:29Z","timestamp":1656231569000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S016763770400094X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,5]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2005,5]]}},"alternative-id":["S016763770400094X"],"URL":"https:\/\/doi.org\/10.1016\/j.orl.2004.05.011","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[2005,5]]}}}