A faster algorithm for determining the linear feasibility of systems of BTVPI constraints (Q6169536): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compendium of problems complete for symmetric logarithmic space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for solving systems of linear equations with two variables per equation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial algorithm for Horn programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255462 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms For Linear Inequalities with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier-Motzkin elimination and its dual / rank
 
Normal rank
Property / cites work
 
Property / cites work: The ellipsoid method and its consequences in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Frontiers of Combining Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed integer formulations for a routing problem with information collection in wireless networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The octagon abstract domain / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combinatorial certifying algorithm for linear feasibility in UTVPI constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integral Extreme Points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393484 / rank
 
Normal rank

Latest revision as of 15:11, 2 August 2024

scientific article; zbMATH DE number 7726612
Language Label Description Also known as
English
A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
scientific article; zbMATH DE number 7726612

    Statements

    A faster algorithm for determining the linear feasibility of systems of BTVPI constraints (English)
    0 references
    14 August 2023
    0 references
    0 references
    0 references