A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (Q933068): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: San-Yang Liu / rank
Normal rank
 
Property / author
 
Property / author: San-Yang Liu / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: SDPpack / 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/s11766-007-0408-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2085394420 / 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 .699-approximation algorithm for Max-Bisection. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5490818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4004158 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:15, 28 June 2024

scientific article
Language Label Description Also known as
English
A successive quadratic programming algorithm for SDP relaxation of Max-Bisection
scientific article

    Statements

    A successive quadratic programming algorithm for SDP relaxation of Max-Bisection (English)
    0 references
    0 references
    0 references
    0 references
    6 August 2008
    0 references
    semidefinite programming
    0 references
    Max-Bisection
    0 references
    successive quadratic programming
    0 references

    Identifiers