Pages that link to "Item:Q1900149"

The following pages link to Solving the max-cut problem using eigenvalues (Q1900149):

Displaying 18 items.

• On Laplacian spectra of parametric families of closely connected networks with application to cooperative control (Q506453) (← links)
• Cheeger's cut, maxcut and the spectral theory of 1-Laplacian on graphs (Q724411) (← links)
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← links)
• New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
• Maximum cut in fuzzy nature: models and algorithms (Q964947) (← links)
• Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• Laplacian eigenvalues and the maximum cut problem (Q1319025) (← links)
• Node and edge relaxations of the max-cut problem (Q1319044) (← links)
• Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
• The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
• A projection technique for partitioning the nodes of a graph (Q1904714) (← links)
• SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances (Q1925791) (← links)
• Simplicial faces of the set of correlation matrices (Q1991097) (← links)
• SDP-based branch-and-bound for non-convex quadratic integer optimization (Q2416574) (← links)
• A multiple penalty function method for solving max-bisection problems (Q2489432) (← links)
• A multilevel search algorithm for the maximization of submodular functions applied to the quadratic cost partition problem (Q2569153) (← links)
• A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)