On the complexity of cutting-plane proofs using split cuts (Q969513): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The monotone circuit complexity of Boolean functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for cutting planes proofs with small coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edmonds polytopes and a hierarchy of combinatorial problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of cutting-plane proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Matrix-Cut Rank of Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exponential lower bound for the size of monotone real circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Chvátal closures for mixed integer programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Valid inequalities based on simple mixed-integer sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: MIR closures of polyhedral sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequential pairing of mixed integer inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Several notes on the power of Gomory-Chvátal cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds to the size of constant-depth propositional proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Mixed Integer Rounding to Solve MIPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive procedure to generate all cuts for 0-1 mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for resolution and cutting plane proofs and monotone computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4934563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054818 / rank
 
Normal rank

Latest revision as of 19:58, 2 July 2024

scientific article
Language Label Description Also known as
English
On the complexity of cutting-plane proofs using split cuts
scientific article

    Statements

    On the complexity of cutting-plane proofs using split cuts (English)
    0 references
    0 references
    7 May 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting-plane proof
    0 references
    split cut
    0 references
    mixed-integer rounding
    0 references
    monotone interpolation
    0 references
    0 references