The role of rationality in integer-programming relaxations (Q6126664): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
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: On defining sets of vertices of the hypercube by linear inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient MIP techniques for computing the relaxation complexity / 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: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expressing combinatorial optimization problems by linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative ranks, decompositions, and factorizations of nonnegative matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonnegative Matrix Factorization Requires Irrationality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations, nonnegative factorizations, and randomized communication protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations for matroid polytopes through randomized protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations from communication protocols in output-efficient time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Matroids Have Polynomial Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branched Polyhedral Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3386630 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using separation algorithms to generate mixed integer model reformulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds for Polytopes in Combinatorial Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Matching Polytope has Exponential Extension Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3751649 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871770 / rank
 
Normal rank

Revision as of 21:59, 29 August 2024

scientific article; zbMATH DE number 7829616
Language Label Description Also known as
English
The role of rationality in integer-programming relaxations
scientific article; zbMATH DE number 7829616

    Statements

    The role of rationality in integer-programming relaxations (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 April 2024
    0 references
    relaxation complexity
    0 references
    simplex
    0 references
    irrational numbers
    0 references

    Identifiers

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