{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:27:07Z","timestamp":1759667227496},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T00:00:00Z","timestamp":1307491200000},"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-9169-z","type":"journal-article","created":{"date-parts":[[2011,6,7]],"date-time":"2011-06-07T20:02:05Z","timestamp":1307476925000},"page":"645-677","source":"Crossref","is-referenced-by-count":8,"title":["Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems"],"prefix":"10.1007","volume":"19","author":[{"given":"Sa\u00efd","family":"Hanafi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ahmed-Riadh","family":"Rebai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"Vasquez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,6,8]]},"reference":[{"issue":"2","key":"9169_CR1","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/j.disopt.2004.03.006","volume":"1","author":"W.P. Adams","year":"2004","unstructured":"Adams, W.P., Forrester, R.J., Glover, F.W.: Comparisons and enhancement strategies for linearizing mixed 0\u20131 quadratic programs. Discrete Optim. 1(2), 99\u2013120 (2004)","journal-title":"Discrete Optim."},{"key":"9169_CR2","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1080\/00207729408928968","volume":"25","author":"B. Alidaee","year":"1994","unstructured":"Alidaee, B., Kochenberger, G., Ahmadian, A.: 0-1 quadratic programming approach for the optimal solution of two scheduling problems. Int. J. Syst. Sci. 25, 401\u2013408 (1994)","journal-title":"Int. J. Syst. Sci."},{"issue":"1","key":"9169_CR3","doi-asserted-by":"crossref","first-page":"93","DOI":"10.4018\/jamc.2010102605","volume":"1","author":"B. Alidaee","year":"2010","unstructured":"Alidaee, B., Kochenberger, G., Wang, H.: Theorems supporting r-flip search for pseudo-boolean optimization. Int. J. Appl. Metaheuristic Comput. 1(1), 93\u2013109 (2010)","journal-title":"Int. J. Appl. Metaheuristic Comput."},{"key":"9169_CR4","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1016\/S0377-2217(97)00130-6","volume":"108","author":"T.M. Alkhamis","year":"1998","unstructured":"Alkhamis, T.M., Hasan, M., Ahmed, M.A.: Simulated annealing for the unconstrained binary quadratic pseudo-boolean function. Eur. J. Oper. Res. 108, 641\u2013652 (1998)","journal-title":"Eur. J. Oper. Res."},{"key":"9169_CR5","first-page":"317","volume-title":"New Methods in Optimization","author":"M. Amini","year":"1999","unstructured":"Amini, M., Alidaee, B., Kochenberger, G.: A scatter search approach to unconstrained quadratic binary programs. In: Corne, Dorigo, Glover (eds.) New Methods in Optimization, pp.\u00a0317\u2013330. McGraw-Hill, New York (1999)"},{"key":"9169_CR6","unstructured":"Badics, T.: Approximation of Some Nonlinear Binary Optimization Problems. PhD thesis, RUTCOR, Rutgers University (1996)"},{"key":"9169_CR7","unstructured":"Balas, E.: Extension de\u00a0l\u2019algorithme additif \u00e0 la\u00a0programmation en nombres entiers et \u00e0 la\u00a0programmation non lin\u00e9aire. C. R. Acad. Sci. Paris (1964)"},{"key":"9169_CR8","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"Beasley, J.E.: Or-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41, 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"9169_CR9","unstructured":"Beasley, J.E.: Heuristic algorithms for the unconstrained binary quadratic programming problem. Working Paper, Imperial College (1998)"},{"key":"9169_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/3-540-31182-3_1","volume":"2","author":"I. Borgulya","year":"2005","unstructured":"Borgulya, I.: An evolutionary algorithm for the binary quadratic problems. Adv. Soft Comput. 2, 3\u201316 (2005)","journal-title":"Adv. Soft Comput."},{"key":"9169_CR11","unstructured":"Boros, E., Hammer, P.L.: A max-flow approach to improved roof-duality in quadratic 0\u20131 minimization. Research Report 15, Rutgers Center for Operations Research, Rutgers University, New Brunswick, NJ (1989)"},{"key":"9169_CR12","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1016\/S0166-218X(01)00341-9","volume":"123","author":"E. Boros","year":"2002","unstructured":"Boros, E., Hammer, P.L.: Pseudo-boolean optimization. Discrete Appl. Math. 123, 155\u2013225 (2002)","journal-title":"Discrete Appl. Math."},{"key":"9169_CR13","doi-asserted-by":"crossref","unstructured":"Boros, E., Hammer, P., Sun, X.: The DDT method for quadratic 0-1 minimization. RUTCOR Research Center, RRR 39-89 (1989)","DOI":"10.1016\/0167-6377(90)90044-6"},{"key":"9169_CR14","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.L., Tavares, G.: Local search heuristics for quadratic unconstrained binary optimization (QUBO). J. Heuristics 13, 99\u2013132 (2007)","journal-title":"J. Heuristics"},{"key":"9169_CR15","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1016\/j.disopt.2007.02.001","volume":"5","author":"E. Boros","year":"2008","unstructured":"Boros, E., Hammer, P.L., Sun, R., Tavares, G.: A max-flow approach to improved lower bounds for quadratic unconstrained binary optimization (QUBO). Discrete Optim. 5, 501\u2013529 (2008)","journal-title":"Discrete Optim."},{"issue":"4","key":"9169_CR16","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1287\/mnsc.41.4.704","volume":"41","author":"P. Chartaire","year":"1994","unstructured":"Chartaire, P., Sutter, A.: A decomposition method for quadratic zero-one programming. Manag. Sci. 41(4), 704\u2013712 (1994)","journal-title":"Manag. Sci."},{"key":"9169_CR17","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1287\/opre.42.5.860","volume":"42","author":"T.A. Feo","year":"1994","unstructured":"Feo, T.A., Resende, M.G.C., Smith, S.H.: A greedy randomized adaptive search procedure for maximum independent set. Oper. Res. 42, 860\u2013878 (1994)","journal-title":"Oper. Res."},{"issue":"4","key":"9169_CR18","first-page":"5","volume":"1","author":"R. Fortet","year":"1959","unstructured":"Fortet, R.: L\u2019alg\u00e8bre de Boole et ses Applications en Recherche Operationnelle. Cah. Cent. Etudes Rech. Oper. 1(4), 5\u201336 (1959)","journal-title":"Cah. Cent. Etudes Rech. Oper."},{"key":"9169_CR19","first-page":"17","volume":"4","author":"R. Fortet","year":"1960","unstructured":"Fortet, R.: Applications de\u00a0l\u2019alg\u00e8bre de\u00a0Boole en recherche op\u00e9rationelle. Rev. Fr. Info. Rech. Op\u00e9r. 4, 17\u201326 (1960)","journal-title":"Rev. Fr. Info. Rech. Op\u00e9r."},{"key":"9169_CR20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01589108","volume":"45","author":"G. Gallo","year":"1998","unstructured":"Gallo, G., Simeone, B.: On the supermodular knapsack problem. Math. Program. 45, 295\u2013309 (1998)","journal-title":"Math. Program."},{"key":"9169_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/mnsc.22.4.455","volume":"22","author":"F. Glover","year":"1975","unstructured":"Glover, F.: Improved linear integer programming formulations of nonlinear integer problems. Manag. Sci. 22, 455\u2013460 (1975)","journal-title":"Manag. Sci."},{"issue":"1","key":"9169_CR22","first-page":"469","volume":"5","author":"F. Glover","year":"1984","unstructured":"Glover, F.: An improved MIP formulation for products of discrete and continuous variables. J. Inf. Optim. Sci. 5(1), 469\u2013471 (1984)","journal-title":"J. Inf. Optim. Sci."},{"key":"9169_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(01)00263-3","volume":"119","author":"F. Glover","year":"2002","unstructured":"Glover, F., Hanafi, S.: Tabu search and finite convergence. Discrete Appl. Math. 119, 3\u201336 (2002). Special Issue on \u201cFoundations of Heuristics in Combinatorial Optimization\u201d","journal-title":"Discrete Appl. Math."},{"key":"9169_CR24","doi-asserted-by":"crossref","unstructured":"Glover, F., Hao, J.K.: Fast 2-fip move evaluations for binary unconstrained quadratic optimization problems. Working paper, LERIA, Universit\u00e9 d\u2019Angers (2009)","DOI":"10.1504\/IJMHEUR.2010.034201"},{"issue":"1","key":"9169_CR25","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1504\/IJMHEUR.2010.033120","volume":"1","author":"F. Glover","year":"2010","unstructured":"Glover, F., Hao, J.K.: Efficient evaluations for solving large 0-1 unconstrained quadratic optimization problems. Int. J. Metaheuristics 1(1), 3\u201310 (2010)","journal-title":"Int. J. Metaheuristics"},{"key":"9169_CR26","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F. Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic, Dordrecht (1997)"},{"key":"9169_CR27","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1287\/opre.22.1.180","volume":"22","author":"F. Glover","year":"1974","unstructured":"Glover, F., Woolsey, E.: Converting the 0\u20131 polynomial programming problem to a 0\u20131 linear program. Oper. Res. 22, 180\u2013182 (1974)","journal-title":"Oper. Res."},{"issue":"3","key":"9169_CR28","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.: Adaptive memory tabu search for binary quadratic programs. Manag. Sci. 44(3), 336\u2013345 (1998)","journal-title":"Manag. Sci."},{"key":"9169_CR29","unstructured":"Glover, F., Kochenberger, G., Alidaee, B., Amini, M.: Unconstrained quadratic binary program approach to quadratic knapsack problems. Working paper, Hearin Center for Enterprise Science, University of Mississippi (1999a)"},{"key":"9169_CR30","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/978-1-4615-5775-3_7","volume-title":"Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization","author":"F. Glover","year":"1999","unstructured":"Glover, F., Kochenberger, G., Alidaee, B., Amini, M.: Tabu search with critical event memory: an enhanced application for binary quadratic programs. In: Voss, S.M.S., Osman, I., Roucairol, C. (eds.) Meta-Heuristics, Advances and Trends in Local Search Paradigms for Optimization, pp. 93\u2013109. Kluwer, Dordrecht (1999b)"},{"key":"9169_CR31","unstructured":"Glover, F., Amini, M., Kochenberger, G., Alidaee, B.: A new evolutionary metaheuristic for the unconstrained binary quadratic programming: a case study of the scatter search. School of Business, University of Colorado, Boulder (September 1999c)"},{"key":"9169_CR32","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.: One-pass heuristics for large-scale unconstrained binary quadratic problems. Eur. J. Oper. Res. 137, 272\u2013287 (2002)","journal-title":"Eur. J. Oper. Res."},{"key":"9169_CR33","author":"F. Glover","year":"2010","unstructured":"Glover, F., L\u00fc, Z., Hao, J.-K.: Diversification-driven tabu search for unconstrained binary quadratic problems. 4OR (2010). doi: 10.1007\/s10288-009-0115-y","journal-title":"4OR"},{"key":"9169_CR34","volume-title":"Genetic Algorithms in Search Optimization and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison Wesley, Reading (1989), p.\u00a041"},{"issue":"5","key":"9169_CR35","doi-asserted-by":"crossref","first-page":"946","DOI":"10.1287\/opre.31.5.946","volume":"31","author":"A.J. Goldman","year":"1983","unstructured":"Goldman, A.J.: Linearization in 0\u20131 variables: a clarification. Oper. Res. 31(5), 946\u2013947 (1983)","journal-title":"Oper. Res."},{"key":"9169_CR36","doi-asserted-by":"crossref","unstructured":"Gueye, S., Michelon, P.: \u201cMiniaturized\u201d linearizations for quadratic 0\u20131 problems. Ann. Oper. Res. 140 (2005)","DOI":"10.1007\/s10479-005-3973-5"},{"key":"9169_CR37","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-85823-9","volume-title":"Boolean Methods in Operations Research and Related Areas","author":"P.L. Hammer","year":"1968","unstructured":"Hammer, P.L., Rudeanu, S.: Boolean Methods in Operations Research and Related Areas. Springer, Berlin (1968)"},{"key":"9169_CR38","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1007\/BF02612354","volume":"28","author":"P.L. Hammer","year":"1984","unstructured":"Hammer, P.L., Hansen, P., Simeone, B.: Roof duality, complementation and persistency in quadratic 0\u20131 optimization. Math. Program. 28, 121\u2013155 (1984)","journal-title":"Math. Program."},{"key":"9169_CR39","volume-title":"INFORMS National Meeting","author":"P. Hammer","year":"1998","unstructured":"Hammer, P., Boros, E., Sun, X.: On quadratic unconstrained binary optimization. In: INFORMS National Meeting, Seattle, October (1998)"},{"key":"9169_CR40","doi-asserted-by":"crossref","first-page":"1267","DOI":"10.1016\/j.dam.2007.12.008","volume":"157","author":"P. Hansen","year":"2009","unstructured":"Hansen, P., Meyer, C.: Improved compact linearizations for the unconstrained quadratic 0\u20131 minimization problem. Discrete Appl. Math. 157, 1267\u20131290 (2009)","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"9169_CR41","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1287\/ijoc.5.2.97","volume":"5","author":"P. Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Mathon, V.: Constrained nonlinear 0-1 programming. INFORMS J. Comput. 5(2), 97\u2013119 (1993)","journal-title":"INFORMS J. Comput."},{"key":"9169_CR42","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1307\/mmj\/1028989917","volume":"2","author":"F. Harary","year":"1953\/54","unstructured":"Harary, F.: On the notion of balanced of a signed graph. Mich. Math. J. 2, 143\u2013146 (1953\/54)","journal-title":"Mich. Math. J."},{"key":"9169_CR43","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1016\/S0377-2217(00)00242-3","volume":"134","author":"K. Katayama","year":"2001","unstructured":"Katayama, K., Narihisa, H.: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem. Eur. J. Oper. Res. 134, 103\u2013119 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"9169_CR44","first-page":"643","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201900)","author":"K. Katayama","year":"2000","unstructured":"Katayama, K., Tani, M., Narihisa, H.: Solving large binary quadratic programming problems by an effective genetic local search algorithm. In: Proceedings of the Genetic and Evolutionary Computation Conference (GECCO\u201900), pp. 643\u2013650. Morgan Kaufmann, San Mateo (2000)"},{"key":"9169_CR45","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gerlatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 671\u2013680 (1983)","journal-title":"Science"},{"key":"9169_CR46","unstructured":"Kochenberger, G., Alidaee, B., Amini, M.: Applications of the unconstrained quadratic binary program. University of Colorado Working Paper (1998)"},{"key":"9169_CR47","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BFb0120827","volume":"9","author":"J. Krarup","year":"1978","unstructured":"Krarup, J., Pruzan, A.: Computer aided layout design. Math. Program. Stud. 9, 75\u201394 (1978)","journal-title":"Math. Program. Stud."},{"key":"9169_CR48","doi-asserted-by":"crossref","first-page":"454","DOI":"10.1287\/opre.18.3.454","volume":"14","author":"D.J. Laughunn","year":"1970","unstructured":"Laughunn, D.J.: Quadratic binary programming. Oper. Res. 14, 454\u2013461 (1970)","journal-title":"Oper. Res."},{"issue":"3","key":"9169_CR49","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.M.: An evolutionary heuristic for quadratic 0-1 programming. Eur. J. Oper. Res. 119(3), 662\u2013670 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9169_CR50","volume-title":"Iterated Local Search. Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated Local Search. Handbook of Metaheuristics. Springer, Berlin (2003)"},{"key":"9169_CR51","volume-title":"Proceedings of the 8th Metaheuristic International Conference (MIC 2009)","author":"Z. L\u00fc","year":"2009","unstructured":"L\u00fc, Z., Glover, F., Hao, J.K.: Neighborhood combination for unconstrained binary quadratic programming. In: Proceedings of the 8th Metaheuristic International Conference (MIC 2009), Hamburg, Germany, 13\u201316 July (2009)"},{"key":"9169_CR52","author":"Z. L\u00fc","year":"2010","unstructured":"L\u00fc, Z., Glover, F., Hao, J.-K.: A hybrid metaheuristic approach to solving the UBQP problem. Eur. J. Oper. Res. (2010). doi: 10.1016\/j.ejor.2010.06.039","journal-title":"Eur. J. Oper. Res."},{"key":"9169_CR53","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1287\/mnsc.26.3.282","volume":"26","author":"R.D. McBride","year":"1980","unstructured":"McBride, R.D., Yormack, J.S.: An implicit enumeration algorithm for quadratic integer programming. Manag. Sci. 26, 282\u2013296 (1980)","journal-title":"Manag. Sci."},{"key":"9169_CR54","first-page":"417","volume-title":"Proceedings of the 1999 International Genetic and Evolutionary Computation Conference (GECCO\u201999)","author":"P. Merz","year":"1999","unstructured":"Merz, P., Freisleben, B.: Genetic algorithms for binary quadratic programming. In: Proceedings of the 1999 International Genetic and Evolutionary Computation Conference (GECCO\u201999), pp. 417\u2013424. Morgan Kaufmann, San Mateo (1999)"},{"key":"9169_CR55","doi-asserted-by":"crossref","unstructured":"Merz, P., Freisleben, B.: Greedy and local search heuristics for unconstrained binary quadratic programming. J. Heuristics, 197\u2013213 (2002)","DOI":"10.1023\/A:1017912624016"},{"key":"9169_CR56","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.: Memetic algorithms for the unconstrained binary quadratic programming problem. Biosystems 78, 99\u2013118 (2004)","journal-title":"Biosystems"},{"key":"9169_CR57","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"9169_CR58","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1023\/B:ANOR.0000039522.58036.68","volume":"131","author":"G. Palubeckis","year":"2004","unstructured":"Palubeckis, G.: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem. Ann. Oper. Res. 131, 259\u2013282 (2004)","journal-title":"Ann. Oper. Res."},{"issue":"2","key":"9169_CR59","doi-asserted-by":"crossref","first-page":"279","DOI":"10.15388\/Informatica.2006.138","volume":"17","author":"G. Palubeckis","year":"2006","unstructured":"Palubeckis, G.: Iterated tabu search for the unconstrained binary quadratic optimization problem. Informatica 17(2), 279\u2013296 (2006)","journal-title":"Informatica"},{"key":"9169_CR60","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","volume":"45","author":"P. Pardalos","year":"1990","unstructured":"Pardalos, P., Rodgers, G.P.: Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131\u2013144 (1990)","journal-title":"Computing"},{"key":"9169_CR61","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0305-0548(92)90067-F","volume":"19","author":"P. Pardalos","year":"1992","unstructured":"Pardalos, P., Rodgers, G.P.: A branch and bound algorithm for maximum clique problem. Comput. Oper. Res. 19, 363\u2013375 (1992)","journal-title":"Comput. Oper. Res."},{"key":"9169_CR62","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","volume":"4","author":"P. Pardalos","year":"1994","unstructured":"Pardalos, P., Xue, J.: The maximum clique problem. J. Glob. Optim. 4, 301\u2013328 (1994)","journal-title":"J. Glob. Optim."},{"key":"9169_CR63","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF01096724","volume":"4","author":"A.T. Phillips","year":"1994","unstructured":"Phillips, A.T., Rosen, J.B.: A quadratic assignment formulation of the molecular conformation problem. J. Glob. Optim. 4, 229\u2013241 (1994)","journal-title":"J. Glob. Optim."},{"key":"9169_CR64","unstructured":"Plateau, M.-C.: Reformulations quadratiques convexes pour la\u00a0programmation quadratique en variables 0-1. Ph.D. Thesis, Conservatoire National des Arts et M\u00e9tiers \/ CEDRIC (November 2006) (in French, available online at http:\/\/www.cedric.cnam.fr\/PUBLIS\/RC1115.pdf )"},{"key":"9169_CR65","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1287\/opre.15.6.1171","volume":"15","author":"L.J. Watters","year":"1967","unstructured":"Watters, L.J.: Reduction of integer polynomial programming problems to zero-one linear programming problems. Oper. Res. 15, 1171\u20131174 (1967)","journal-title":"Oper. Res."},{"key":"9169_CR66","unstructured":"Williams, A.C.: Quadratic 0-1 programming using the roof duality with computational results. Rutcor Research Report 8-85, Rutgers University, New Brunswick, NJ (1985)"},{"key":"9169_CR67","doi-asserted-by":"crossref","unstructured":"Witsgall, C.: Mathematical methods of site selection for electronic system (EMS). NBS Internal Report (1975)","DOI":"10.6028\/NBS.IR.75-737"},{"issue":"3","key":"9169_CR68","first-page":"30","volume":"5","author":"W.I. Zangwill","year":"1965","unstructured":"Zangwill, W.I.: Media selection by decision programming. J. Advert. Res. 5(3), 30\u201336 (1965)","journal-title":"J. Advert. Res."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9169-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-011-9169-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-011-9169-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,19]],"date-time":"2020-06-19T23:02:44Z","timestamp":1592607764000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-011-9169-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,8]]},"references-count":68,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,8]]}},"alternative-id":["9169"],"URL":"https:\/\/doi.org\/10.1007\/s10732-011-9169-z","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,6,8]]}}}