{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T12:42:35Z","timestamp":1780317755080,"version":"3.54.1"},"reference-count":42,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1995,9,1]],"date-time":"1995-09-01T00:00:00Z","timestamp":809913600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6529,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,9]]},"DOI":"10.1016\/0166-218x(94)00155-7","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"249-278","source":"Crossref","is-referenced-by-count":55,"title":["Solving the max-cut problem using eigenvalues"],"prefix":"10.1016","volume":"62","author":[{"given":"Svatopluk","family":"Poljak","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Franz","family":"Rendl","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00155-7_BIB1","article-title":"On cuts and matchings in planar graphs","author":"Barahona","year":"1988"},{"key":"10.1016\/0166-218X(94)00155-7_BIB2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1287\/opre.36.3.493","article-title":"An application of combinatorial optimization to statistical physics and circuit layout design","volume":"36","author":"Barahona","year":"1988","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)00155-7_BIB3","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF01587084","article-title":"Experiments in quadratic 0\u20131 programming","volume":"44","author":"Barahona","year":"1989","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00155-7_BIB4","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02592023","article-title":"On the cut polytope","volume":"36","author":"Barahona","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00155-7_BIB5","series-title":"Proceedings of the 28th Annual Symposium on Computer Science","first-page":"280","article-title":"Eigenvalues and graph bisection: An average case","author":"Boppana","year":"1987"},{"key":"10.1016\/0166-218X(94)00155-7_BIB6","first-page":"55","article-title":"The minimization of certain nondifferentiable sums of eigenvalues of symmetric matrices","volume":"3","author":"Cullum","year":"1976","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(94)00155-7_BIB7","volume":"Vols. 1 and 2","author":"Cullum","year":"1985"},{"key":"10.1016\/0166-218X(94)00155-7_BIB8","first-page":"393","article-title":"Solution of a large scale traveling salesman problem","volume":"2","author":"Dantzig","year":"1954","journal-title":"Oper. Res."},{"key":"10.1016\/0166-218X(94)00155-7_BIB9","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/BF01585184","article-title":"Laplacian eigenvalues and the maximum cut problem","volume":"63","author":"Delorme","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00155-7_BIB10","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1006\/eujc.1993.1035","article-title":"Combinatorial properties and the complexity of a max-cut approximation","volume":"14","author":"Delorme","year":"1993","journal-title":"European J. Combin."},{"key":"10.1016\/0166-218X(94)00155-7_BIB11","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0012-365X(93)90151-I","article-title":"The performance of an eigenvalue bound on the max-cut problem in some classes of graphs","volume":"111","author":"Delorme","year":"1993","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(94)00155-7_BIB12","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1147\/rd.175.0420","article-title":"Lower bounds for the partitioning of graphs","volume":"17","author":"Donath","year":"1973","journal-title":"IBM J. Res. Develop."},{"key":"10.1016\/0166-218X(94)00155-7_BIB13","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1145\/362588.362593","article-title":"A man-machine approach toward solving the travelling-salesman-problem","volume":"14","author":"Felts","year":"1971","journal-title":"Comm. ACM"},{"key":"10.1016\/0166-218X(94)00155-7_BIB14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.21136\/CMJ.1973.101168","article-title":"Algebraic connectivity of graphs","volume":"23","author":"Fiedler","year":"1973","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0166-218X(94)00155-7_BIB15","first-page":"587","article-title":"On the second eigenvalue in random regular graphs","volume":"89","author":"Friedman","year":"1989","journal-title":"FOCS"},{"key":"10.1016\/0166-218X(94)00155-7_BIB16","article-title":"878 approximation Algorithm for max-cut and max-2sat","author":"Goemans","year":"1993"},{"key":"10.1016\/0166-218X(94)00155-7_BIB17","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/BFb0121155","article-title":"Eigenvalue perturbations and nonlinear parametric optimization","volume":"30","author":"Gollan","year":"1987","journal-title":"Math. Programming Stud."},{"key":"10.1016\/0166-218X(94)00155-7_BIB18","article-title":"Matrix Computations","author":"Golub","year":"1989"},{"key":"10.1016\/0166-218X(94)00155-7_BIB19","series-title":"Polyedrische Charakterisierungen kombinatorischer Optimierungsprobleme","author":"Gr\u00f6tschel","year":"1977"},{"key":"10.1016\/0166-218X(94)00155-7_BIB20","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/BF01586932","article-title":"Solution of large-scale symmetric travelling salesman problems","volume":"51","author":"Gr\u00f6tschel","year":"1991","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00155-7_BIB21","doi-asserted-by":"crossref","first-page":"727","DOI":"10.1287\/moor.17.3.727","article-title":"A new lower bound via projection for the quadratic assignment problem","volume":"17","author":"Hadley","year":"1992","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(94)00155-7_BIB22","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1137\/0110015","article-title":"A dynamic programming approach to sequencing problems","volume":"10","author":"Held","year":"1962","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(94)00155-7_BIB23","series-title":"Matrix Analysis","author":"Horn","year":"1985"},{"key":"10.1016\/0166-218X(94)00155-7_BIB24","volume":"Vols. 1 and 2","author":"Ibaraki","year":"1987"},{"key":"10.1016\/0166-218X(94)00155-7_BIB25","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0022-0000(88)90046-3","article-title":"How easy is local search?","volume":"37","author":"Johnson","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0166-218X(94)00155-7_BIB26","series-title":"Algebraic Methods in Graph Theory","first-page":"313","article-title":"On the spectrum of a random graph","author":"Juh\u00e1sz","year":"1981"},{"key":"10.1016\/0166-218X(94)00155-7_BIB27","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1287\/mnsc.10.2.225","article-title":"A heuristic approach to solving travelling salesman problems","volume":"10","author":"Karg","year":"1964","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(94)00155-7_BIB28","series-title":"Complexity of Computer Computation","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/0166-218X(94)00155-7_BIB29","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","article-title":"An efficient heuristic procedure for partitioning graphs","volume":"49","author":"Kerningham","year":"1970","journal-title":"Bell System Tech. J."},{"key":"10.1016\/0166-218X(94)00155-7_BIB30","series-title":"Theory of Matrices","author":"Lancaster","year":"1969"},{"key":"10.1016\/0166-218X(94)00155-7_BIB31","series-title":"Graph Theory","first-page":"871","article-title":"The Laplacian spectrum of graphs","volume":"Vol. 2","author":"Mohar","year":"1991"},{"issue":"115","key":"10.1016\/0166-218X(94)00155-7_BIB32","doi-asserted-by":"crossref","first-page":"343","DOI":"10.21136\/CMJ.1990.102386","article-title":"Eigenvalues and the max-cut problem","volume":"40","author":"Mohar","year":"1990","journal-title":"Czechoslovak Math. J."},{"key":"10.1016\/0166-218X(94)00155-7_BIB33","article-title":"Eigenvalues in Combinatorial Optimization","volume":"50","author":"Mohar","year":"1993"},{"key":"10.1016\/0166-218X(94)00155-7_BIB34","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02247879","article-title":"Computational aspects of a branch and bound algorithm for quadratic zero-one programming","volume":"40","author":"Pardalos","year":"1990","journal-title":"Computing"},{"key":"10.1016\/0166-218X(94)00155-7_BIB35","series-title":"Sets, Graphs and Numbers","first-page":"569","article-title":"Polyhedral and eigenvalue approximations of the max-cut problem","volume":"60","author":"Poljak","year":"1992"},{"key":"10.1016\/0166-218X(94)00155-7_BIB36","article-title":"Nonpolyhedral relaxations of graph bisection problems","author":"Poljak","year":"1993"},{"key":"10.1016\/0166-218X(94)00155-7_BIB37","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/BF02238072","article-title":"Node and edge relaxations of the max-cut problem","volume":"52","author":"Poljak","year":"1994","journal-title":"Computing"},{"key":"10.1016\/0166-218X(94)00155-7_BIB38","article-title":"Interior-point method for max-min eigenvalue problems","author":"Rendl","year":"1993"},{"key":"10.1016\/0166-218X(94)00155-7_BIB39","article-title":"A projection technique for partitioning the nodes of a graph","author":"Rendl","year":"1990"},{"key":"10.1016\/0166-218X(94)00155-7_BIB40","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF01585694","article-title":"Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem","volume":"53","author":"Rendl","year":"1992","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(94)00155-7_BIB41","series-title":"Advances in Mathematical Optimization","first-page":"196","article-title":"A combination of the bundle approach and the trust region concept","author":"Schramm","year":"1988"},{"key":"10.1016\/0166-218X(94)00155-7_BIB42","article-title":"Block Lanczos software for symmetric eigenvalue problems","author":"Scott","year":"1979"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001557?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94001557?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T05:40:34Z","timestamp":1620970834000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94001557"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,9]]},"references-count":42,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1995,9]]}},"alternative-id":["0166218X94001557"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00155-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,9]]}}}