Semidefinite programming based approaches to the break minimization problem (Q2583777): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q2751584 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2779815 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing breaks by maximizing cuts. / 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: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm to find an equitable home--away assignment / rank
 
Normal rank
Property / cites work
 
Property / cites work: NEW APPROXIMATION ALGORITHMS FOR MAX 2SAT AND MAX DICUT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737518 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementation and evaluation of SDPA 6.0 (Semidefinite Programming Algorithm 6.0) / rank
 
Normal rank

Latest revision as of 14:24, 11 June 2024

scientific article
Language Label Description Also known as
English
Semidefinite programming based approaches to the break minimization problem
scientific article

    Statements

    Semidefinite programming based approaches to the break minimization problem (English)
    0 references
    0 references
    0 references
    18 January 2006
    0 references
    sports timetabling
    0 references
    approximation algorithm
    0 references
    semidefinite programming
    0 references
    0 references
    0 references
    0 references

    Identifiers