Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (Q2235285)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints |
scientific article |
Statements
Polynomial time algorithms for optimal length tree-like refutations of linear infeasibility in UTVPI constraints (English)
0 references
21 October 2021
0 references
0 references
0 references
0 references
