A projection technique for partitioning the nodes of a graph (Q1904714): Difference between revisions

From MaRDI portal
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3338296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Heuristic for Partitioning the Nodes of a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Optimal Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The equipartition polytope. I: Formulations, dimension and basic facets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4127646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties and the complexity of a max-cut approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laplacian eigenvalues and the maximum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Partitioning of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares with a quadratic constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constrained eigenvalue problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Optimal Locally Constrained Steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eigenvalue perturbations and nonlinear parametric optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Lower Bound Via Projection for the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234142 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A continuous method for computing bounds in integer quadratic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3997942 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5202209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing a Trust Region Step / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Sum of the Largest Eigenvalues of a Symmetric Matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the max-cut problem using eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning Sparse Matrices with Eigenvectors of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of parametric programming and eigenvalue maximization to the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02032130 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2069037000 / rank
 
Normal rank

Latest revision as of 10:55, 30 July 2024

scientific article
Language Label Description Also known as
English
A projection technique for partitioning the nodes of a graph
scientific article

    Statements

    A projection technique for partitioning the nodes of a graph (English)
    0 references
    0 references
    0 references
    7 January 1996
    0 references
    undirected graph
    0 references
    continuous optimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers