Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (Q5963676): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: DBLP publication ID (P1635): journals/coap/PongSWW16, #quickstatements; #temporary_batch_1741970510855
 
(8 intermediate revisions by 8 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10589-015-9779-8 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: SDPT3 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1648726702 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57511176 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1401.5170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new bound for the quadratic assignment problem based on convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lagrangian Relaxation of Quadratic Matrix Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916398 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving quadratic assignment problems using convex quadratic programming relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial matrix theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming bounds for graph bandwidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4348513 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5492525 / 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: The variation of the spectrum of a normal matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cones of Matrices and Set-Functions and 0–1 Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the matrix bandwidth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3656591 / 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 projection technique for partitioning the nodes of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bandwidth, Vertex Separators, and Eigenvalue Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011249 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving semidefinite-quadratic-linear programs using SDPT3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming relaxations for the quadratic assignment problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10589-015-9779-8 / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/coap/PongSWW16 / rank
 
Normal rank

Latest revision as of 18:42, 14 March 2025

scientific article; zbMATH DE number 6544364
Language Label Description Also known as
English
Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem
scientific article; zbMATH DE number 6544364

    Statements

    Eigenvalue, quadratic programming, and semidefinite programming relaxations for a cut minimization problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 February 2016
    0 references
    vertex separators
    0 references
    eigenvalue bounds
    0 references
    semidefinite programming bounds
    0 references
    graph partitioning
    0 references
    large scale
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers