A linear programming approach to the Manickam-Miklós-Singhi conjecture (Q2441613): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Nonnegative \(k\)-sums, fractional covers, and probability of small deviations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4063504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Manickam and Singhi / rank
 
Normal rank
Property / cites work
 
Property / cites work: The first distribution invariant of the Johnson-scheme / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of lattices and boolean functions related to the Manickam–Miklös–Singhi conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem concerning the weight functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: New results related to a conjecture of Manickam and Singhi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a problem on non-negative subset sums / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348035 / rank
 
Normal rank
Property / cites work
 
Property / cites work: First distribution invariants and EKR theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A method to count the positive 3-subsets in a set of real numbers with non-negative sum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2732561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved bound for the Manickam-Miklós-Singhi conjecture / rank
 
Normal rank

Latest revision as of 13:01, 7 July 2024

scientific article
Language Label Description Also known as
English
A linear programming approach to the Manickam-Miklós-Singhi conjecture
scientific article

    Statements

    A linear programming approach to the Manickam-Miklós-Singhi conjecture (English)
    0 references
    0 references
    0 references
    25 March 2014
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    branching strategy
    0 references
    computational method
    0 references
    0 references
    0 references
    0 references
    0 references