A faster algorithm for determining the linear feasibility of systems of BTVPI constraints
From MaRDI portal
Publication:6169536
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
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 1324220 (Why is no real title available?)
- scientific article; zbMATH DE number 1161568 (Why is no real title available?)
- A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
- A combinatorial algorithm for Horn programs
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints
- A compendium of problems complete for symmetric logarithmic space
- A fast algorithm for solving systems of linear equations with two variables per equation
- A new polynomial-time algorithm for linear programming
- Fourier-Motzkin elimination and its dual
- Frontiers of Combining Systems
- Improved Algorithms For Linear Inequalities with Two Variables Per Inequality
- Integral Extreme Points
- Introduction to algorithms.
- Mixed integer formulations for a routing problem with information collection in wireless networks
- Network flows. Theory, algorithms, and applications.
- Simple and Fast Algorithms for Linear and Integer Programs with Two Variables Per Inequality
- The ellipsoid method and its consequences in combinatorial optimization
- The octagon abstract domain
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)
