{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T11:14:02Z","timestamp":1724843642511},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,12,1]],"date-time":"2009-12-01T00:00:00Z","timestamp":1259625600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2010,11]]},"DOI":"10.1007\/s10898-009-9499-7","type":"journal-article","created":{"date-parts":[[2009,11,30]],"date-time":"2009-11-30T03:31:44Z","timestamp":1259551904000},"page":"447-463","source":"Crossref","is-referenced-by-count":4,"title":["Semidefinite approximations for quadratic programs over orthogonal matrices"],"prefix":"10.1007","volume":"48","author":[{"given":"Janez","family":"Povh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,12,1]]},"reference":[{"key":"9499_CR1","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/s10107-003-0437-z","volume":"97","author":"K. Anstreicher","year":"2003","unstructured":"Anstreicher K.: Recent advances in the solution of quadratic assignment problems. Math. Program. B 97, 27\u201342 (2003)","journal-title":"Math. Program. B"},{"key":"9499_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-9260(95)00008-4","volume":"19","author":"C.J. Alpert","year":"1995","unstructured":"Alpert C.J., Kahng A.B.: Recent directions in netlist partition: a survey. Integr. VLSI J. 19, 1\u201381 (1995)","journal-title":"Integr. VLSI J."},{"key":"9499_CR3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/S0895479898340299","volume":"22","author":"K. Anstreicher","year":"2000","unstructured":"Anstreicher K., Wolkowicz H.: On lagrangian relaxation of quadratic matrix constraints. SIAM J. Matrix Anal. Appl. 22, 41\u201355 (2000)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"9499_CR4","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1006\/jcss.1998.1605","volume":"58","author":"S. Arora","year":"1999","unstructured":"Arora S., Karger D., Karpinski M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193\u2013210 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"9499_CR5","doi-asserted-by":"crossref","first-page":"1224","DOI":"10.1137\/05064816X","volume":"17","author":"A. Beck","year":"2007","unstructured":"Beck A.: Quadratic matrix programming. SIAM J. Optim. 17, 1224\u20131238 (2007)","journal-title":"SIAM J. Optim."},{"key":"9499_CR6","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","volume":"18","author":"I. Bomze","year":"2000","unstructured":"Bomze I., Duer M., de Klerk E., Roos C., Quist A.J., Terlaky T.: On copositive programming and standard quadratic optimization problems. J. Glob. Optim. 18, 301\u2013320 (2000)","journal-title":"J. Glob. Optim."},{"key":"9499_CR7","doi-asserted-by":"crossref","unstructured":"Burer, S.: On the copositive representation of binary and continuous nonconvex quadratic programs. Math. Program., published online on April 29th (2008)","DOI":"10.1007\/s10107-008-0223-z"},{"key":"9499_CR8","doi-asserted-by":"crossref","first-page":"726","DOI":"10.1137\/040609574","volume":"16","author":"S. Burer","year":"2006","unstructured":"Burer S., Vandenbussche D.: Solving lift-and-project relaxations of binary integer programs. SIAM J. Optim. 16, 726\u2013750 (2006)","journal-title":"SIAM J. Optim."},{"key":"9499_CR9","unstructured":"Burkard, R.E., Cela, E., Karisch, S.E., Rendl, F.: QAPLIB\u2014a quadratic assignment problem library. Available at http:\/\/www.seas.upenn.edu\/qaplib\/ , July (2007)"},{"key":"9499_CR10","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E. Klerk de","year":"2002","unstructured":"de Klerk E., Pasechnik D.V.: Approximation of the stability number of a graph via copositive programming. SIAM J. Optim. 12, 875\u2013892 (2002)","journal-title":"SIAM J. Optim."},{"key":"9499_CR11","unstructured":"de Klerk, E., Sotirov, R.: Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem. To appear in Math. Program., available on http:\/\/www.springerlink.com\/content\/85302n245v250051\/fulltext.pdf ."},{"key":"9499_CR12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"Donath W.E., Hoffman A.J.: Lower bounds for the partitioning of graphs. IBM J. Res. Dev. 17, 420\u2013425 (1973)","journal-title":"IBM J. Res. Dev."},{"issue":"2","key":"9499_CR13","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01581147","volume":"66","author":"J. Falkner","year":"1994","unstructured":"Falkner J., Rendl F., Wolkowicz H.: A computational study of graph partitioning. Math. Program. 66(2), 211\u2013240 (1994)","journal-title":"Math. Program."},{"key":"9499_CR14","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. Freeman, San Francisco (1979)"},{"key":"9499_CR15","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/s004530010013","volume":"27","author":"N. Guttmann-Beck","year":"2000","unstructured":"Guttmann-Beck N., Hassin R.: Approximation algorithms for minimum K-cut. Algorithmica 27, 198\u2013207 (2000)","journal-title":"Algorithmica"},{"key":"9499_CR16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1080\/03081089508818381","volume":"39","author":"C. Helmberg","year":"1995","unstructured":"Helmberg C., Rendl F., Mohar B., Poljak S.: A spectral approach to bandwidth and separator problems in graphs. Linear Multilinear Algebra 39, 73\u201390 (1995)","journal-title":"Linear Multilinear Algebra"},{"key":"9499_CR17","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1215\/S0012-7094-53-02004-3","volume":"20","author":"A.J. Hoffman","year":"1953","unstructured":"Hoffman A.J., Wielandt H.W.: The variation of the spectrum of a normal matrix. Duke Math. J. 20, 37\u201339 (1953)","journal-title":"Duke Math. J."},{"key":"9499_CR18","doi-asserted-by":"crossref","unstructured":"Karisch, S.E., Rendl, F.: Semidefinite programming and graph equipartition. In: Topics in Semidefinite and Interior-point Methods, The Fields Institute for Research in Mathematical Sciences, vol. 18. Communications Series, American Mathematical Society, Providence, RI (1998)","DOI":"10.1090\/fic\/018\/06"},{"issue":"1","key":"9499_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s10107-002-0342-x","volume":"95","author":"A. Lisser","year":"2003","unstructured":"Lisser A., Rendl F.: Graph partitioning using linear and semidefinite programming. Math. Program. 95(1), 91\u2013101 (2003)","journal-title":"Math. Program."},{"key":"9499_CR20","doi-asserted-by":"crossref","first-page":"533","DOI":"10.4153\/CJM-1965-053-6","volume":"17","author":"T.S. Motzkin","year":"1965","unstructured":"Motzkin T.S., Straus E.G.: Maxima for graphs and a new proof of a theorem of T\u00faran. Can. J. Math. 17, 533\u2013540 (1965)","journal-title":"Can. J. Math."},{"key":"9499_CR21","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1998","unstructured":"Papadimitriou C.H., Steiglitz K.: Combinatorial Optimization: Algorithms and Complexity. Dover Publications, Mineola, NY (1998)"},{"key":"9499_CR22","unstructured":"Povh, J.: Application of semidefinite and copositive programming in combinatorial optimization. PhD Thesis, University of Ljubljana, Ljubljana (2006)"},{"key":"9499_CR23","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J. Povh","year":"2007","unstructured":"Povh J., Rendl F.: A copositive programming approach to graph partitioning. SIAM J. Optim. 18, 223\u2013241 (2007)","journal-title":"SIAM J. Optim."},{"key":"9499_CR24","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J. Povh","year":"2009","unstructured":"Povh J., Rendl F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discrete Optim. 6, 231\u2013241 (2009)","journal-title":"Discrete Optim."},{"issue":"2\u20133","key":"9499_CR25","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1007\/s10107-006-0038-8","volume":"109","author":"F. Rendl","year":"2007","unstructured":"Rendl F., Sotirov R.: Bounds for the quadratic assignment problem using the bundle method. Math. Program. 109(2\u20133), 505\u2013524 (2007)","journal-title":"Math. Program."},{"key":"9499_CR26","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/BF02032130","volume":"58","author":"F. Rendl","year":"1995","unstructured":"Rendl F., Wolkowicz H.: A projection technique for partitioning the nodes of a graph. Ann. Oper. Res. 58, 155\u2013179 (1995)","journal-title":"Ann. Oper. Res."},{"key":"9499_CR27","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/S0166-218X(99)00102-X","volume":"96\u201397","author":"H. Wolkowicz","year":"1999","unstructured":"Wolkowicz H., Zhao Q.: Semidefinite programming relaxations for the graph partitioning problem. Discrete Appl. Math. 96\u201397, 461\u2013479 (1999)","journal-title":"Discrete Appl. Math."},{"key":"9499_CR28","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q. Zhao","year":"1998","unstructured":"Zhao Q., Karisch S.E., Rendl F., Wolkowicz H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Comb. Optim. 2, 71\u2013109 (1998)","journal-title":"J. Comb. Optim."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9499-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-009-9499-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-009-9499-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:58:55Z","timestamp":1559264335000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-009-9499-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,12,1]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,11]]}},"alternative-id":["9499"],"URL":"https:\/\/doi.org\/10.1007\/s10898-009-9499-7","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,12,1]]}}}