Efficient MIP techniques for computing the relaxation complexity (Q6095738): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Polyhedral separability through successive LP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational aspects of relaxation complexity: possibilities and limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of linear relaxations in integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer reformulations of integer programs and the affine TU-dimension of a matrix / rank
 
Normal rank
Property / cites work
 
Property / cites work: Orbitopal fixing for the full (sub-)orbitope and application to the unit commitment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lifting Linear Extension Complexity Bounds to the Mixed-Integer Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial size IP formulations of knapsack may require exponentially large coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong IP formulations need large coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polytopes associated with symmetry handling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the extension complexity of polytopes separating subsets of the Boolean cube / rank
 
Normal rank
Property / cites work
 
Property / cites work: On defining sets of vertices of the hypercube by linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: The densest hemisphere problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the sizes of integer programs without additional variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dimension of the Lisbon voting rules in the EU council: a challenge and new world record / rank
 
Normal rank
Property / cites work
 
Property / cites work: Accurately learning from few examples with a polyhedral classifier / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on resolving infeasibility in linear programs by constraint relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic Security Evaluation and (Related-key) Differential Characteristic Search: Application to SIMON, PRESENT, LBlock, DES(L) and Other Bit-Oriented Block Ciphers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematics and Politics / rank
 
Normal rank

Revision as of 19:36, 2 August 2024

scientific article; zbMATH DE number 7735740
Language Label Description Also known as
English
Efficient MIP techniques for computing the relaxation complexity
scientific article; zbMATH DE number 7735740

    Statements

    Efficient MIP techniques for computing the relaxation complexity (English)
    0 references
    0 references
    0 references
    0 references
    8 September 2023
    0 references
    mixed-integer programming models
    0 references
    relaxation complexity
    0 references
    branch-and-price
    0 references
    branch-and-cut
    0 references
    0 references

    Identifiers

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