A faster algorithm for determining the linear feasibility of systems of BTVPI constraints

DOI10.1007/978-3-031-23101-8_21zbMath1528.90158OpenAlexW4313429621MaRDI QIDQ6169536

Piotr J. Wojciechowski, K. Subramani and Vahan Mkrtchyan

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-031-23101-8_21

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Integer programming (90C10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
• A new polynomial-time algorithm for linear programming
• The octagon abstract domain
• A fast algorithm for solving systems of linear equations with two variables per equation
• The ellipsoid method and its consequences in combinatorial optimization
• Mixed integer formulations for a routing problem with information collection in wireless networks
• A combinatorial algorithm for Horn programs
• Fourier-Motzkin elimination and its dual
• A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
• Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
• Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
• Frontiers of Combining Systems
• Integral Extreme Points
• A compendium of problems complete for symmetric logarithmic space

This page was built for publication: A faster algorithm for determining the linear feasibility of systems of BTVPI constraints