{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T16:37:26Z","timestamp":1648917446178},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,2,27]],"date-time":"2014-02-27T00:00:00Z","timestamp":1393459200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Wireless Pers Commun"],"published-print":{"date-parts":[[2014,8]]},"DOI":"10.1007\/s11277-014-1639-9","type":"journal-article","created":{"date-parts":[[2014,2,26]],"date-time":"2014-02-26T21:31:11Z","timestamp":1393450271000},"page":"2305-2339","source":"Crossref","is-referenced-by-count":1,"title":["Novel Algorithms for Quadratic Programming by Using Hypergraph Representations"],"prefix":"10.1007","volume":"77","author":[{"given":"D\u00e1vid","family":"Tisza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s","family":"Ol\u00e1h","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00e1nos","family":"Levendovszky","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,27]]},"reference":[{"key":"1639_CR1","doi-asserted-by":"crossref","unstructured":"Aumage, O., Brunet, E., Furmento, N., & Namyst, R. (2007). New madeleine: A fast communication scheduling engine for high performance networks. In Parallel and distributed processing symposium, 2007. IPDPS 2007. IEEE international (pp. 1\u20138). doi: 10.1109\/IPDPS.2007.370476 .","DOI":"10.1109\/IPDPS.2007.370476"},{"issue":"1","key":"1639_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0166-218X(86)90065-X","volume":"13","author":"F Barahona","year":"1986","unstructured":"Barahona, F. (1986). A solvable case of quadratic 0\u20131 programming. Discrete Applied Mathematics, 13(1), 23\u201326.","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1639_CR3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","volume":"44","author":"F Barahona","year":"1989","unstructured":"Barahona, F., J\u00fcnger, M., & Reinelt, G. (1989). Experiments in quadratic 0\u20131 programming. Mathematical Programming, 44(1), 127\u2013137.","journal-title":"Mathematical Programming"},{"key":"1639_CR4","volume-title":"Heuristic algorithms for the unconstrained binary quadratic programming problem","author":"J Beasley","year":"1998","unstructured":"Beasley, J. (1998). Heuristic algorithms for the unconstrained binary quadratic programming problem. London: Management School, Imperial College."},{"issue":"11","key":"1639_CR5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"JE Beasley","year":"1990","unstructured":"Beasley, J. E. (1990). OR-Library: Distributing test problems by electronic mail. Journal of the Operational Research Society, 41(11), 1069\u20131072.","journal-title":"Journal of the Operational Research Society"},{"key":"1639_CR6","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10107-005-0637-9","volume":"109","author":"A Billionnet","year":"2007","unstructured":"Billionnet, A., & Elloumi, S. (2007). Using a mixed integer quadratic programming solver for the unconstrained quadratic 0\u20131 problem. Mathematical Programming, 109, 55\u201368. doi: 10.1007\/s10107-005-0637-9 .","journal-title":"Mathematical Programming"},{"key":"1639_CR7","first-page":"89","volume":"39","author":"E Boros","year":"1989","unstructured":"Boros, E., Hammer, P., & Sun, X. (1989). The ddt method for quadratic 0\u20131 minimization. RUTCOR Research Center, RRR, 39, 89.","journal-title":"RUTCOR Research Center, RRR"},{"issue":"2","key":"1639_CR8","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1007\/s10732-007-9009-3","volume":"13","author":"E Boros","year":"2007","unstructured":"Boros, E., Hammer, P., & Tavares, G. (2007). Local search heuristics for quadratic unconstrained binary optimization (qubo). Journal of Heuristics, 13(2), 99\u2013132.","journal-title":"Journal of Heuristics"},{"key":"1639_CR9","doi-asserted-by":"crossref","unstructured":"Chicano, F., & Alba, E. (2011). Elementary landscape decomposition of the 0\u20131 unconstrained quadratic optimization. Journal of Heuristics pp, 1\u201318. doi: 10.1007\/s10732-011-9170-6 .","DOI":"10.1007\/s10732-011-9170-6"},{"key":"1639_CR10","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/s11276-007-0050-9","volume":"15","author":"H Choi","year":"2009","unstructured":"Choi, H., Wang, J., & Hughes, E. (2009). Scheduling for information gathering on sensor network. Wireless Networks, 15, 127\u2013140. doi: 10.1007\/s11276-007-0050-9 .","journal-title":"Wireless Networks"},{"issue":"10","key":"1639_CR11","doi-asserted-by":"crossref","first-page":"2389","DOI":"10.1109\/TIT.2003.817444","volume":"49","author":"M Damen","year":"2003","unstructured":"Damen, M., El Gamal, H., & Caire, G. (2003). On maximum-likelihood detection and the search for the closest lattice point. Information Theory, IEEE Transactions on, 49(10), 2389\u20132402. doi: 10.1109\/TIT.2003.817444 .","journal-title":"Information Theory, IEEE Transactions on"},{"issue":"1","key":"1639_CR12","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/0012-365X(90)90056-N","volume":"79","author":"C Simone De","year":"1990","unstructured":"De Simone, C. (1990). The cut polytope and the boolean quadric polytope. Discrete Mathematics, 79(1), 71\u201375.","journal-title":"Discrete Mathematics"},{"key":"1639_CR13","unstructured":"For Official Publications of the European Communities O. (1989). Digital land mobile radio communications: cost 207, final report. Technical Report."},{"issue":"1","key":"1639_CR14","first-page":"48","volume":"4","author":"N Fogarasi","year":"2012","unstructured":"Fogarasi, N., Tornai, K., & Levendovszky, J. (2012). A novel hopfield neural network approach for minimizing total weighted tardiness of jobs scheduled on identical machines. Acta Univ Sapientiae Informatica, 4(1), 48\u201366.","journal-title":"Acta Univ Sapientiae Informatica"},{"key":"1639_CR15","volume-title":"Computers and intractability","author":"M Garey","year":"1979","unstructured":"Garey, M., & Johnson, D. (1979). Computers and intractability (Vol. 174). San Francisco, CA: Freeman."},{"key":"1639_CR16","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1287\/mnsc.44.3.336","volume":"44","author":"F Glover","year":"1998","unstructured":"Glover, F., Kochenberger, G., & Alidaee, B. (1998). Adaptive memory tabu search for binary quadratic programs. Management Science, 44, 336\u2013345.","journal-title":"Management Science"},{"issue":"2","key":"1639_CR17","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0377-2217(01)00209-0","volume":"137","author":"F Glover","year":"2002","unstructured":"Glover, F., Alidaee, B., Rego, C., & Kochenberger, G. (2002). One-pass heuristics for large-scale unconstrained binary quadratic problems. European Journal of Operational Research, 137(2), 272\u2013287.","journal-title":"European Journal of Operational Research"},{"issue":"4","key":"1639_CR18","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1109\/TIT.1967.1054048","volume":"13","author":"R Gold","year":"1967","unstructured":"Gold, R. (1967). Optimal binary sequences for spread spectrum multiplexing (corresp.). IEEE Transactions on Information Theory, 13(4), 619\u2013621. doi: 10.1109\/TIT.1967.1054048 .","journal-title":"IEEE Transactions on Information Theory"},{"key":"1639_CR19","doi-asserted-by":"crossref","unstructured":"Hanafi, S., Rebai, A. R., & Vasquez, M. (2011). Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems. Journal of Heuristics, 1\u201333. doi: 10.1007\/s10732-011-9169-z .","DOI":"10.1007\/s10732-011-9169-z"},{"key":"1639_CR20","volume-title":"An introduction to analog and digital communications","author":"S Haykin","year":"2006","unstructured":"Haykin, S., & Moher, M. (2006). An introduction to analog and digital communications. London: Wiley."},{"issue":"3","key":"1639_CR21","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01580072","volume":"82","author":"C Helmberg","year":"1998","unstructured":"Helmberg, C., & Rendl, F. (1998). Solving quadratic (0, 1)-problems by semidefinite programs and cutting planes. Mathematical Programming, 82(3), 291\u2013315.","journal-title":"Mathematical Programming"},{"issue":"7","key":"1639_CR22","doi-asserted-by":"crossref","first-page":"2055","DOI":"10.1016\/j.sigpro.2012.12.020","volume":"93","author":"G Kaddoum","year":"2013","unstructured":"Kaddoum, G., & Gagnon, F. (2013). Fast communication: Performance analysis of STBC-CSK communication system over slow fading channel. Signal Processing, 93(7), 2055\u20132060. doi: 10.1016\/j.sigpro.2012.12.020 .","journal-title":"Signal Processing"},{"issue":"6","key":"1639_CR23","doi-asserted-by":"crossref","first-page":"925","DOI":"10.1007\/s00034-009-9124-5","volume":"28","author":"G Kaddoum","year":"2009","unstructured":"Kaddoum, G., Charge\u00e9, P., Roviras, D., & Fournier-Prunaret, D. (2009). A methodology for bit error rate prediction in chaos-based communication systems. Circuits, Systems and Signal Processing, 28(6), 925\u2013944. doi: 10.1007\/s00034-009-9124-5 .","journal-title":"Circuits, Systems and Signal Processing"},{"key":"1639_CR24","doi-asserted-by":"crossref","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., & Rego, C. (2004a). Solving combinatorial optimization problems via reformulation and adaptive memory metaheuristics. In Menon, A. (ed) Frontiers of evolutionary computation, genetic algorithms and evolutionary computation (vol. 11, pp. 103\u2013113). Springer, US. doi: 10.1007\/1-4020-7782-3_5 .","DOI":"10.1007\/1-4020-7782-3_5"},{"issue":"2","key":"1639_CR25","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/s00291-003-0153-3","volume":"26","author":"G Kochenberger","year":"2004","unstructured":"Kochenberger, G., Glover, F., Alidaee, B., & Rego, C. (2004b). A unified modeling and solution framework for combinatorial optimization problems. OR Spectrum, 26(2), 237\u2013250.","journal-title":"OR Spectrum"},{"issue":"3","key":"1639_CR26","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1109\/MSP.2009.932126","volume":"26","author":"E Larsson","year":"2009","unstructured":"Larsson, E. (2009). Mimo detection methods: How they work [lecture notes]. Signal Processing Magazine, IEEE, 26(3), 91\u201395. doi: 10.1109\/MSP.2009.932126 .","journal-title":"Signal Processing Magazine, IEEE"},{"key":"1639_CR27","doi-asserted-by":"crossref","unstructured":"Levendovszky, J., Tornai, K., Treplan, G., & Olah, A. (2011). Novel load balancing algorithms ensuring uniform packet loss probabilities for wsn. In Vehicular technology conference (VTC Spring), 2011 IEEE 73rd (pp. 1\u20135). doi: 10.1109\/VETECS.2011.5956703 .","DOI":"10.1109\/VETECS.2011.5956703"},{"key":"1639_CR28","doi-asserted-by":"crossref","unstructured":"Li, H., Shenoy, P., & Ramamritham, K. (2005). Scheduling messages with deadlines in multi-hop real-time sensor networks. In Real time and embedded technology and applications symposium, 2005. RTAS 2005. 11th IEEE (pp. 415\u2013425). doi: 10.1109\/RTAS.2005.48 .","DOI":"10.1109\/RTAS.2005.48"},{"issue":"3","key":"1639_CR29","doi-asserted-by":"crossref","first-page":"662","DOI":"10.1016\/S0377-2217(98)00359-2","volume":"119","author":"A Lodi","year":"1999","unstructured":"Lodi, A., Allemand, K., & Liebling, T. (1999). An evolutionary heuristic for quadratic 0\u20131 programming. European Journal of Operational Research, 119(3), 662\u2013670.","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"1639_CR30","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1109\/MSP.2010.936019","volume":"27","author":"Z Luo","year":"2010","unstructured":"Luo, Z., Ma, W., So, A., Ye, Y., & Zhang, S. (2010). Semidefinite relaxation of quadratic optimization problems. Signal Processing Magazine, IEEE, 27(3), 20\u201334.","journal-title":"Signal Processing Magazine, IEEE"},{"key":"1639_CR31","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1023\/A:1017912624016","volume":"8","author":"P Merz","year":"2002","unstructured":"Merz, P., & Freisleben, B. (2002). Greedy and local search heuristics for unconstrained binary quadratic programming. Journal of Heuristics, 8, 197\u2013213. doi: 10.1023\/A:1017912624016 .","journal-title":"Journal of Heuristics"},{"issue":"1\u20133","key":"1639_CR32","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.biosystems.2004.08.002","volume":"78","author":"P Merz","year":"2004","unstructured":"Merz, P., & Katayama, K. (2004). Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems, 78(1\u20133), 99\u2013118. doi: 10.1016\/j.biosystems.2004.08.002 .","journal-title":"Biosystems"},{"issue":"2","key":"1639_CR33","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G Palubeckis","year":"2006","unstructured":"Palubeckis, G. (2006). Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica, 17(2), 279\u2013296.","journal-title":"Informatica"},{"key":"1639_CR34","doi-asserted-by":"crossref","unstructured":"Picard, J.-C., & Ratliff, H. D. (1973). Mathematical programming and its applications. Operations Research, 21(1), 261\u2013269.","DOI":"10.1287\/opre.21.1.261"},{"issue":"4","key":"1639_CR35","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1002\/net.3230050405","volume":"5","author":"J Picard","year":"1975","unstructured":"Picard, J., & Ratliff, H. (1975). Minimum cuts and related problems. Networks, 5(4), 357\u2013370.","journal-title":"Networks"},{"issue":"1","key":"1639_CR36","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1007\/BF01100205","volume":"7","author":"S Poljak","year":"1995","unstructured":"Poljak, S., Rendl, F., & Wolkowicz, H. (1995). A recipe for semidefinite relaxation for (0, 1)-quadratic programming. Journal of Global Optimization, 7(1), 51\u201373.","journal-title":"Journal of Global Optimization"},{"key":"1639_CR37","volume-title":"Digital communications","author":"J Proakis","year":"2007","unstructured":"Proakis, J., & Salehi, M. (2007). Digital communications (5th ed.). London: McGraw-Hill Science\/Engineering\/Math.","edition":"5"},{"issue":"10","key":"1639_CR38","doi-asserted-by":"crossref","first-page":"1024","DOI":"10.1049\/iet-com.2012.0763","volume":"7","author":"N Rahnama","year":"2013","unstructured":"Rahnama, N., & Talebi, S. (2013). Performance comparison of chaotic spreading sequences generated by two different classes of chaotic systems in a chaos-based direct sequencecode division multiple access system. Communications, IET, 7(10), 1024\u20131031. doi: 10.1049\/iet-com . 2012.0763.","journal-title":"Communications, IET"},{"issue":"6","key":"1639_CR39","doi-asserted-by":"crossref","first-page":"1301","DOI":"10.1109\/72.728380","volume":"9","author":"K Smith","year":"1998","unstructured":"Smith, K., Palaniswami, M., & Krishnamoorthy, M. (1998). Neural techniques for combinatorial optimization with applications. Neural Networks, IEEE Transactions on, 9(6), 1301\u20131318.","journal-title":"Neural Networks, IEEE Transactions on"},{"key":"1639_CR40","doi-asserted-by":"crossref","unstructured":"Smith, K. A. (1999). Neural networks for combinatorial optimization: A review of more than a decade of research. INFORMS Journal on Computing, 11(1), 15\u201334. doi:10.1287\/ijoc.11.1.15 http:\/\/joc.journal.informs.org\/content\/11\/1\/15.abstract , http:\/\/joc.journal.informs.org\/content\/11\/1\/15.full.pdf+html .","DOI":"10.1287\/ijoc.11.1.15"},{"key":"1639_CR41","volume-title":"Multiuser detection","author":"S Verdu","year":"1998","unstructured":"Verdu, S. (1998). Multiuser detection. Cambridge: Cambridge University Press."},{"issue":"8","key":"1639_CR42","doi-asserted-by":"crossref","first-page":"5758","DOI":"10.1016\/j.eswa.2010.02.032","volume":"37","author":"J Wang","year":"2010","unstructured":"Wang, J. (2010). Discrete hopfield network combined with estimation of distribution for unconstrained binary quadratic programming problem. Expert Systems with Applications, 37(8), 5758\u20135774.","journal-title":"Expert Systems with Applications"}],"container-title":["Wireless Personal Communications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-014-1639-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11277-014-1639-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11277-014-1639-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,15]],"date-time":"2020-08-15T20:29:24Z","timestamp":1597523364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11277-014-1639-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,27]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,8]]}},"alternative-id":["1639"],"URL":"https:\/\/doi.org\/10.1007\/s11277-014-1639-9","relation":{},"ISSN":["0929-6212","1572-834X"],"issn-type":[{"value":"0929-6212","type":"print"},{"value":"1572-834X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,27]]}}}