{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:50:06Z","timestamp":1773798606800,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1007\/bf02032130","type":"journal-article","created":{"date-parts":[[2005,8,10]],"date-time":"2005-08-10T15:19:28Z","timestamp":1123687168000},"page":"155-179","source":"Crossref","is-referenced-by-count":46,"title":["A projection technique for partitioning the nodes of a graph"],"prefix":"10.1007","volume":"58","author":[{"given":"Franz","family":"Rendl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Henry","family":"Wolkowicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02032130_CR1","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1137\/0603056","volume":"3","author":"E.R. Barnes","year":"1982","unstructured":"E.R. Barnes, An algorithm for partitioning the nodes of a graph, SIAM J. Alg. Discr. Math. 3(1982)541\u2013550.","journal-title":"SIAM J. Alg. Discr. Math."},{"key":"BF02032130_CR2","doi-asserted-by":"crossref","unstructured":"E.R. Barnes and A.J. Hoffman, Partitioning, spectra, and linear programming, in:Progress in Combinatorial Optimization, ed. W.E. Pulleyblank (Academic Press, 1984) pp. 13\u201325.","DOI":"10.1016\/B978-0-12-566780-7.50007-6"},{"key":"BF02032130_CR3","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1137\/0401030","volume":"1","author":"E.R. Barnes","year":"1988","unstructured":"E.R. Barnes, A. Vannelli and J.Q. Walker, A new heuristic for partitioning the nodes of a graph, SIAM J. Discr. Math. 1(1988)299\u2013305.","journal-title":"SIAM J. Discr. Math."},{"key":"BF02032130_CR4","doi-asserted-by":"crossref","unstructured":"R.B. Boppana, Eigenvalues and graph bisection: An average case analysis, in:Proc. 28th Annual Symp. on Computer Science (IEEE, 1987) pp. 280\u2013285.","DOI":"10.1109\/SFCS.1987.22"},{"key":"BF02032130_CR5","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1137\/0130006","volume":"30","author":"N. Christofides","year":"1976","unstructured":"N. Christofides and P. Brooker, The optimal partitioning of graphs, SIAM J. Appl. Math. 30(1976)55\u201369.","journal-title":"SIAM J. Appl. Math."},{"key":"BF02032130_CR6","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1007\/BF01588778","volume":"49","author":"M. Conforti","year":"1990","unstructured":"M. Conforti, M.R. Rao and S. Sassano, The equipartition polytope, Math. Progr. 49(1990)49\u201390.","journal-title":"Math. Progr."},{"key":"BF02032130_CR7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/BFb0120698","volume":"3","author":"J. Cullum","year":"1975","unstructured":"J. Cullum, W.E. Donath and P. Wolfe, The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices, Math. Progr. Study 3(1975)35\u201355.","journal-title":"Math. Progr. Study"},{"key":"BF02032130_CR8","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/eujc.1993.1035","volume":"14","author":"Ch. Delorme","year":"1993","unstructured":"Ch. Delorme and S. Poljak, Combinatorial properties and the complexity of a max-cut approximation, Euro. J. Combinatorics 14(1993)313\u2013333.","journal-title":"Euro. J. Combinatorics"},{"key":"BF02032130_CR9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","volume":"62","author":"Ch. Delorme","year":"1993","unstructured":"Ch. Delorme and S. Poljak, Laplacian eigenvalues and the maximum cut problem, Math. Progr. 62(1993)557\u2013574.","journal-title":"Math. Progr."},{"key":"BF02032130_CR10","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","volume":"17","author":"W.E. Donath","year":"1973","unstructured":"W.E. Donath and A.J. Hoffman, Lower bounds for the partitioning of graphs, IBM J. Res. Develop. 17(1973)420\u2013425.","journal-title":"IBM J. Res. Develop."},{"key":"BF02032130_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1007\/BF01581147","volume":"66","author":"J. Falkner","year":"1994","unstructured":"J. Falkner, F. Rendl and H. Wolkowicz, A computational study of graph partitioning, Math. Progr. 66(1994)211\u2013240.","journal-title":"Math. Progr."},{"key":"BF02032130_CR12","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1007\/BF01396656","volume":"36","author":"W. Gander","year":"1981","unstructured":"W. Gander, Least squares with a quadratic constraint, Numer. Math. 36(1981)291\u2013307.","journal-title":"Numer. Math."},{"key":"BF02032130_CR13","doi-asserted-by":"crossref","first-page":"815","DOI":"10.1016\/0024-3795(89)90494-1","volume":"114\/115","author":"W. Gander","year":"1989","unstructured":"W. Gander, G.H. Golub and U. von Matt, A constrained eigenvalue problem, Lin. Alg. Appl. 114\/115(1989)815\u2013839.","journal-title":"Lin. Alg. Appl."},{"key":"BF02032130_CR14","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1137\/0902016","volume":"2","author":"D.M. Gay","year":"1981","unstructured":"D.M. Gay, Computing optimal locally constrained steps, SIAM J. Sci. Stat. Comput. 2(1981)186\u2013197.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02032130_CR15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0121155","volume":"30","author":"B. Gollan","year":"1987","unstructured":"B. Gollan, Eigenvalue perturbations and nonlinear parametric optimization, Math. Progr. Studies 30(1987)67\u201381.","journal-title":"Math. Progr. Studies"},{"key":"BF02032130_CR16","volume-title":"Continuous optimization approaches for the quadratic assignment problem","author":"S.W. Hadley","year":"1989","unstructured":"S.W. Hadley, Continuous optimization approaches for the quadratic assignment problem, Ph.D. Thesis, University of Waterloo, Canada (1989)."},{"key":"BF02032130_CR17","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","volume":"17","author":"S.W. Hadley","year":"1992","unstructured":"S.W. Hadley, F. Rendl and H. Wolkowicz, A new lower bound via projection for the quadratic assignment problem, Math. Oper. Res. 17(1992)727\u2013739.","journal-title":"Math. Oper. Res."},{"key":"BF02032130_CR18","unstructured":"Ch. Helmberg, B. Mohar, S. Poljak and F. Rendl, A spectra approach to bandwidth and separator problems in graphs, Technical Report, Graz (1992)."},{"key":"BF02032130_CR19","unstructured":"A. Kamath and N. Karmakar, A continuous approach to computer upper bounds in quadratic maximization problems with integer constraints,Proc. Conf. on Recent Advances in Global Optimization, ed. Floudas and Pardalos (1991) pp. 125\u2013140."},{"key":"BF02032130_CR20","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1007\/BF00171827","volume":"2","author":"A. Kamath","year":"1992","unstructured":"A. Kamath and N. Karmakar, A continuous method for computing bounds in integer quadratic optimization problems, J. Global Optim. 2(1992)229\u2013241.","journal-title":"J. Global Optim."},{"key":"BF02032130_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-92106-2","volume-title":"Combinatorial Algorithms for Integrated Circuit Layout","author":"T. Lengauer","year":"1990","unstructured":"T. Lengauer,Combinatorial Algorithms for Integrated Circuit Layout (Wiley, Chichester, 1990)."},{"issue":"115","key":"BF02032130_CR22","doi-asserted-by":"crossref","first-page":"343","DOI":"10.21136\/CMJ.1990.102386","volume":"40","author":"B. Mohar","year":"1990","unstructured":"B. Mohar and S. Poljak, Eigenvalues and the max-cut problem, Czech. Math. J. 40(115)(1990) 343\u2013352.","journal-title":"Czech. Math. J."},{"key":"BF02032130_CR23","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1137\/0904038","volume":"4","author":"J.J. Mor\u00e9","year":"1983","unstructured":"J.J. Mor\u00e9 and D.C. Sorensen, Computing a trust region step, SIAM J. Sci. Statist. Comput. 4(1983)553\u2013572.","journal-title":"SIAM J. Sci. Statist. Comput."},{"key":"BF02032130_CR24","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1137\/0613006","volume":"13","author":"M.L. Overton","year":"1992","unstructured":"M.L. Overton and R.S. Womersley, On the sum of the largest eigenvalues of a symmetric matrix, SIAM J. Matrix Anal. Appl. 13(1992)41\u201345.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"BF02032130_CR25","unstructured":"S. Poljak and F. Rendl, Solving the max-cut problem using eigenvalues, Report 91735, Bonn (1991)."},{"key":"BF02032130_CR26","volume-title":"Nonpolyhedral relaxations of graoh bisection problems, Report CDLDO-13","author":"S. Poljak","year":"1992","unstructured":"S. Poljak and F. Rendl, Nonpolyhedral relaxations of graoh bisection problems, Report CDLDO-13, University of Technology, Graz (1992)."},{"key":"BF02032130_CR27","doi-asserted-by":"crossref","first-page":"430","DOI":"10.1137\/0611030","volume":"11","author":"A. Pothen","year":"1990","unstructured":"A. Pothen, H.D. Simon and K.-P. Liou, Partitioning sparse matrices with eigenvectors of graphs, SIAM J. Matrix Anal. Appl. 11(1990)430\u2013452.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"BF02032130_CR28","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01585694","volume":"53","author":"F. Rendl","year":"1992","unstructured":"F. Rendl and H. Wolkowicz, Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem, Math. Progr. 53(1992)63\u201378.","journal-title":"Math. Progr."},{"key":"BF02032130_CR29","unstructured":"C. Roucairol and P. Hansen, Cut cost minimization in graph partitioning, in:Numerical and Applied Mathematics, ed. C. Brezinski (J.C. Baltzer, 1989) pp. 585\u2013587."},{"key":"BF02032130_CR30","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1137\/0802008","volume":"2","author":"H. Schramm","year":"1992","unstructured":"H. Schramm and J. Zowe, A version of the Bundle idea for minimizing a nonsmooth function: Conceptual idea, convergence analysis, numerical results, SIAM J. Optim. 2(1992)121\u2013152.","journal-title":"SIAM J. Optim."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02032130.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02032130\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02032130","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,15]],"date-time":"2021-07-15T04:26:05Z","timestamp":1626323165000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02032130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":30,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["BF02032130"],"URL":"https:\/\/doi.org\/10.1007\/bf02032130","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}