Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints

Piotr J. Wojciechowski, K. Subramani, Matthew D. Williamson. Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints. Discrete Applied Mathematics, 305:272-294, 2021. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.