A branch-and-bound algorithm for solving max-\(k\)-cut problem (Q2231324): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q489091
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1007/s10898-021-00999-z / 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.1007/s10898-021-00999-z / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3131083459 / 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: 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: Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons / 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: A Coordinate Ascent Method for Solving Semidefinite Relaxations of Non-convex Quadratic Integer Programs / 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: Computational study of valid inequalities for the maximum \(k\)-cut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition / 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 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: Set-completely-positive representations and cuts for the max-cut polytope and the unit modulus lifting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved semidefinite bounding procedure for solving max-cut problems to optimality / 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: An Efficient Semidefinite Programming Relaxation for the Graph Partition Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting sparsity for the min \(k\)-partition problem / 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: Semidefinite programming relaxations for the graph partitioning problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Newton-CG Augmented Lagrangian Method for Semidefinite Programming / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S10898-021-00999-Z / rank
 
Normal rank

Latest revision as of 14:30, 17 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-bound algorithm for solving max-\(k\)-cut problem
scientific article

    Statements

    A branch-and-bound algorithm for solving max-\(k\)-cut problem (English)
    0 references
    0 references
    0 references
    29 September 2021
    0 references
    max-\(k\)-cut
    0 references
    semidefinite relaxation
    0 references
    branch-and-bound algorithm
    0 references
    0 references
    0 references

    Identifiers