A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
From MaRDI portal
Publication:6169536
DOI10.1007/978-3-031-23101-8_21zbMATH Open1528.90158OpenAlexW4313429621MaRDI QIDQ6169536FDOQ6169536
Authors: Piotr Wojciechowski, K. Subramani
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
Recommendations
- A Bit-Scaling Algorithm for Integer Feasibility in UTVPI Constraints
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- Integer feasibility and refutations in UTVPI constraints using bit-scaling
- A certifying algorithm for lattice point feasibility in a system of UTVPI constraints
- Frontiers of Combining Systems
Cites Work
- Network flows. Theory, algorithms, and applications.
- The octagon abstract domain
- Title not available (Why is that?)
- A new polynomial-time algorithm for linear programming
- Introduction to algorithms.
- The ellipsoid method and its consequences in combinatorial optimization
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- Title not available (Why is that?)
- Fourier-Motzkin elimination and its dual
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- Integral Extreme Points
- Title not available (Why is that?)
- Frontiers of Combining Systems
- A fast algorithm for solving systems of linear equations with two variables per equation
- A combinatorial algorithm for Horn programs
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
- A compendium of problems complete for symmetric logarithmic space
- Mixed integer formulations for a routing problem with information collection in wireless networks
This page was built for publication: A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6169536)