Deciding Linear Inequalities by Computing Loop Residues
From MaRDI portal
Publication:3922186
DOI10.1145/322276.322288zbMath0468.68073OpenAlexW2090286414MaRDI QIDQ3922186
Publication date: 1981
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/322276.322288
Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10) Linear inequalities of matrices (15A39)
Related Items
A Logic of East and West ⋮ Constraint propagation with interval labels ⋮ Injective convex polyhedra ⋮ The Linear Complementarity Problems with a Few Variables per Constraint ⋮ The dial-A-ride problem with transfers ⋮ Better abstractions for timed automata ⋮ Log-linear dynamics and local potential ⋮ The two variable per inequality abstract domain ⋮ A set partitioning reformulation of a school bus scheduling problem ⋮ Temporal constraint networks ⋮ Weak monotonicity and Bayes-Nash incentive compatibility ⋮ Queries on ontologies with temporal dependences on Allen's extended interval logic ⋮ Unnamed Item ⋮ Triangulations with Circular Arcs ⋮ Testing the necklace condition for shortest tours and optimal factors in the plane ⋮ Querying temporal and spatial constraint networks in PTIME ⋮ A class of polynomially solvable range constraints for interval analysis without widenings
