Trichotomy for integer linear systems based on their sign patterns
From MaRDI portal
Publication:906434
DOI10.1016/j.dam.2015.07.004zbMath1339.90240OpenAlexW2119239813MaRDI QIDQ906434
Publication date: 21 January 2016
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2015.07.004
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving linear programs from sign patterns
- Sign-solvable linear complementarity problems
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- Recognition of \(q\)-Horn formulae in linear time
- Polynomial-time inference of all valid implications for Horn and related formulae
- Simplicial pivoting algorithms for a tractable class of integer programs
- Incremental Satisfiability and Implication for UTVPI Constraints
- Trichotomy for integer linear systems based on their sign patterns
- A New Algorithm for Linear and Integer Feasibility in Horn Constraints
- Integer Programming with a Fixed Number of Variables
- On a routing problem
- 50 Years of Integer Programming 1958-2008
- A Combinatorial Algorithm for Horn Programs
- The Computational Complexity of Simultaneous Diophantine Approximation Problems
- On the complexity of integer programming
- Unit Refutations and Horn Sets
- On the Complexity of Timetable and Multicommodity Flow Problems
- Renaming a Set of Clauses as a Horn Set
- A Complexity Index for Satisfiability Problems
- Scaling Algorithms for the Shortest Paths Problem
- An Improved Tight Closure Algorithm for Integer Octagonal Constraints
- Frontiers of Combining Systems
- Efficient algorithms for integer programs with two variables per constraint.
