A semidefinite relaxation based global algorithm for two-level graph partition problem (Q2698612): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.3934/jimo.2022250 / rank
Normal rank
 
Property / author
 
Property / author: Zhi-bin Deng / rank
Normal rank
 
Property / author
 
Property / author: Zhi-bin Deng / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Biq Mac / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.3934/jimo.2022250 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4312440068 / rank
 
Normal rank
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: Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design / rank
 
Normal rank
Property / cites work
 
Property / cites work: The partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the \(k\)-partition polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: On approximate graph colouring and MAX-\(k\)-CUT algorithms based on the \(\vartheta\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level graph partitioning problem arising in mobile wireless communications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamental Domains for Integer Programs with Symmetries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm based on semidefinite programming for the minimum \(k\)-partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reformulations in mathematical programming: automatic symmetry detection and exploitation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilizer-based symmetry breaking constraints for mathematical programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-bound algorithm for solving max-\(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry in Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified orbital branching for structured symmetry with an application to unit commitment / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbital branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational study of valid inequalities for the maximum \(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.3934/JIMO.2022250 / rank
 
Normal rank

Latest revision as of 20:27, 19 December 2024

scientific article
Language Label Description Also known as
English
A semidefinite relaxation based global algorithm for two-level graph partition problem
scientific article

    Statements

    A semidefinite relaxation based global algorithm for two-level graph partition problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 April 2023
    0 references
    graph partition
    0 references
    semidefinite relaxation
    0 references
    branch-and-bound
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references