Partitioning through projections: strong SDP bounds for large graph partition problems (Q6109293): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Solving k-Way Graph Partitioning Problems to Optimality: The Impact of Semidefinite Relaxations and the Bundle Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection Methods: Swiss Army Knives for Solving Feasibility and Best Approximation Problems with Halfspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3739782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the equicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Lift-and-Project Relaxations of Binary Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A VLSI decomposition of the deBruijn graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming and eigenvalue bounds for the graph partition 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: Matrices Associated With the Hitchcock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Restricted Least Squares Regression / rank
 
Normal rank
Property / cites work
 
Property / cites work: A better upper bound on the bisection width of de Bruijn networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The node capacitated graph partitioning problem: A computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3038523 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cyclic projection algorithm via duality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hybrid evolutionary algorithms for graph coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting plane algorithm for a clustering problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for graph partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5465120 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical formulation of quantum circuit design problems in networks of quantum computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Solving the Quadratic Shortest Path Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400639 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On semidefinite programming relaxations of maximum \(k\)-section / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Maximum <i>k</i>-Colorable Subgraph Problem and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strictly contractive Peaceman-Rachford splitting method for the doubly nonnegative relaxation of the minimum cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-stationary Douglas-Rachford and alternating direction method of multipliers: adaptive step-sizes and convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP-Based Bounds for the Quadratic Cycle Cover Problem via Cutting-Plane Augmented Lagrangian Methods and Reinforcement Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: ADMM for the SDP relaxation of the QAP / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: A boundary point method to solve semidefinite programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The MIN-cut and vertex separator problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the bandwidth 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: SDP Relaxations for Some Combinatorial Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph bisection revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDPNAL+: A Matlab software for semidefinite programming with bound constraints (version 1.0) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Slater condition for the SDP relaxations of nonconvex sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating direction augmented Lagrangian methods for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: SDP-based bounds for graph partition via extended ADMM / 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: Scalable Semidefinite Programming / rank
 
Normal rank

Latest revision as of 14:02, 1 August 2024

scientific article; zbMATH DE number 7706523
Language Label Description Also known as
English
Partitioning through projections: strong SDP bounds for large graph partition problems
scientific article; zbMATH DE number 7706523

    Statements

    Partitioning through projections: strong SDP bounds for large graph partition problems (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    graph partition problems
    0 references
    semidefinite programming
    0 references
    cutting planes
    0 references
    Dykstra's projection algorithm
    0 references
    augmented Lagrangian methods
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers