Probabilistic algorithms for extreme point identification (Q3508860): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hit-and-run algorithms for the identification of nonredundant linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The coupon-collector problem revisited — a survey of engineering problems and computational methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the best case performance of hit and run methods for detecting necessary constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Redundancy in mathematical programming. A state-of-the-art survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4158394 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Polytopes / rank
 
Normal rank

Latest revision as of 13:03, 28 June 2024

scientific article
Language Label Description Also known as
English
Probabilistic algorithms for extreme point identification
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references