Exploiting semidefinite relaxations in constraint programming (Q2489123): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667439 / 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: Solving Graph Bisection Problems with Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles of Constraint Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4517107 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric algorithms and combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connection between semidefinite relaxations of the max-cut and stable set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145799 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Shannon capacity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational Experience with Stable Set Relaxations / rank
 
Normal rank
Property / cites work
 
Property / cites work: CSDP, A C library for semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated empirical optimizations of software and the ATLAS project / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK Users' Guide / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4411385 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2003 / rank
 
Normal rank

Latest revision as of 14:06, 24 June 2024

scientific article
Language Label Description Also known as
English
Exploiting semidefinite relaxations in constraint programming
scientific article

    Statements

    Exploiting semidefinite relaxations in constraint programming (English)
    0 references
    16 May 2006
    0 references
    0 references
    Constraint programming
    0 references
    Semidefinite programming
    0 references
    Limited discrepancy search
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references